Consecutive non-primality P57148

For every natural number $x$, define $N(x)$ as the smallest natural number $y$ such that $y \ge x$ and such that the 250 consecutive numbers $y, y + 1, \dots, y + 249$ are all non-prime.

Your program must print $N(x)$ for every given $x$.

Input

Input consists of several (probably many) natural numbers $x$, each one such that $N(x) < 10^9$.

Output

For every $x$, print $x$ and $N(x)$ in one line.