Smallest Prime Greater or Equal to N

Given an integer \(n\), your task is to find the smallest prime number \(p\) such that \(p \ge n\). A prime number is a number greater than 1 that has no positive divisors other than 1 and itself.

Example:

Input: 10
Output: 11

The solution should read the input from stdin and output the result to stdout.

inputFormat

The input consists of a single line containing a single integer \(n\) \( (1 \le n \le 10^6)\). The integer represents the number for which you need to compute the smallest prime number greater than or equal to \(n\).

outputFormat

Output a single integer which is the smallest prime number greater than or equal to \(n\).

10

11