Nearest Co-Prime

Limits 1s, 512 MB

Two numbers are relatively prime or co-prime if their greatest common divisor is 11.

In this problem, you will be given an integer N\textbf{N}, you will have to find out the the smallest number x ( x > N )\textbf{x ( x > N )}, so that x\textbf{x} and N\textbf{N} are relatively prime.

Input

The only line will have one input NN (1N1018)( 1 \leq N \leq 10^{18} )

Output

In one line, print the desired result.

Sample

InputOutput
1
2