Redundant Redundancy

AtCoder

IDarc110_a

Time2000ms

Memory256MB

Difficulty—

We have an integer $N$. Print an integer $x$ between $N$ and $10^{13}$ (inclusive) such that, for every integer $y$ between $2$ and $N$ (inclusive), the remainder when $x$ is divided by $y$ is $1$. Under the constraints of this problem, there is always at least one such integer $x$. ## Constraints * All values in input are integers. * $2 \leq N \leq 30$ ## Input Input is given from Standard Input in the following format: $N$ [samples]

Samples

Input #1

Output #1

7

The remainder when $7$ is divided by $2$ is $1$, and the remainder when $7$ is divided by $3$ is $1$, too.
$7$ is an integer between $3$ and $10^{13}$, so this is a desirable output.

Input #2

Output #2

39916801

API Response (JSON)

{
  "problem": {
    "name": "Redundant Redundancy",
    "description": {
      "content": "We have an integer $N$. Print an integer $x$ between $N$ and $10^{13}$ (inclusive) such that, for every integer $y$ between $2$ and $N$ (inclusive), the remainder when $x$ is divided by $y$ is $1$. Un",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc110_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have an integer $N$.\nPrint an integer $x$ between $N$ and $10^{13}$ (inclusive) such that, for every integer $y$ between $2$ and $N$ (inclusive), the remainder when $x$ is divided by $y$ is $1$.\nUn...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments