201100: [AtCoder]ARC110 A - Redundant Redundancy

Memory Limit:1024 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $300$ points

Problem Statement

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$

Output

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$.

If there are multiple such integers, any of them will be accepted.


Sample Input 1

3

Sample 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.


Sample Input 2

10

Sample Output 2

39916801

Input

加入题单

上一题 下一题 算法标签: