Brute Force Practice 3
You love prime numbers. You own a number, but you suspect it might not be prime. You want a prime number, but it must be at least as large as the number you currently own. Find the smallest number that satisfies those conditions.
The first line will have the integer ~N~ ~(1 \le N \le 2 \times 10^9)~.
Print the number you want.