Non-Prime Number

Interview

Time limit0.5sMemory limit1024 MB

Summary

Given N, print any integer at least N that is not prime. The answer must be at most 10^9.

Level: Easy2 of 10
Topics: Math, Implementation
Solved: No attempts yet

Problem

One of the organizers of this contest, a KSA student, cannot tell 17 o'clock apart from 19 o'clock. This is because 17 and 19 are both prime. To tell the hours apart and protect KSA's reputation, read an integer $N$ and find any integer that is at least $N$ and is not prime.

Input

The first line contains an integer $N$ .

Output

Print the answer. The answer must be at most $10^{9}$ .

If multiple answers exist, printing any of them is accepted.

Constraints

$1 \leq N \leq 10^{9}$

Examples2

Example 1
Input
```
5
```
Expected output
```
10
```
Example 2
Input
```
6
```
Expected output
```
12
```