# Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

# Nearest Co-Prime

By TarifEzaz · Limits 1s, 512 MB

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

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

## Input

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

## Output

In one line, print the desired result.

## Sample

InputOutput
1

2


### Statistics

94% Solution Ratio

chandlerFastest, 0.0s

nfs277Lightest, 0 B

imamanik05Shortest, 21B