{"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$.\nUnder the constraints of this problem, there is always at least one such integer $x$.\n\n## Constraints\n\n*   All values in input are integers.\n*   $2 \\leq N \\leq 30$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc110_a","tags":[],"sample_group":[["3","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."],["10","39916801"]],"created_at":"2026-03-03 11:01:14"}}