{"raw_statement":[{"iden":"problem statement","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$.\nUnder the constraints of this problem, there is always at least one such integer $x$."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $2 \\leq N \\leq 30$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"3"},{"iden":"sample output 1","content":"7\n\nThe remainder when $7$ is divided by $2$ is $1$, and the remainder when $7$ is divided by $3$ is $1$, too.\n$7$ is an integer between $3$ and $10^{13}$, so this is a desirable output."},{"iden":"sample input 2","content":"10"},{"iden":"sample output 2","content":"39916801"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}