B. Polkadots
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Meg is buying cupcakes for her friend's birthday at Polkadots Cupcake Factory. *This problem is not sponsored by Polkadots Cupcake Factory and does not express the views of Polkadots Cupcake Factory.

All of the cupcakes have some number of polkadots on them. Meg would like to buy a cupcake with at least $$$n$$$ polkadots on it. However, it's well-known that cupcakes with a prime number of polkadots are bad luck. Please help Meg determine how many polkadots her cupcake should have, such that

  • The cupcake has at least $$$n$$$ polkadots,
  • The cupcake has as few polkadots as possible, and
  • The cupcake does not have a prime number of polkadots.
Input

The first and only line contains a single integer $$$n$$$ denoting the minimum number of polkadots Meg wants. $$$(2 \le n \le 1000)$$$

Output

Output a single integer, the minimum number of polkadots Meg's cupcake should have that is not prime and is greater than or equal to $$$n$$$.

Examples
Input
2
Output
4
Input
5
Output
6
Input
1000
Output
1000