Find the Smallest Prime Greater than N

You are given an integer (N). Your task is to find the smallest prime number (p) such that (p > N).

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. Use efficient methods to solve this problem for large inputs.

inputFormat

A single integer (N) is provided via standard input.

outputFormat

Output a single integer -- the smallest prime number strictly greater than (N) printed to standard output.## sample

10

11