Next Prime Finder

Given an integer \(N\), find the smallest prime number greater than \(N\). A prime number \(p\) is a natural number greater than 1 that has no positive divisors other than 1 and \(p\) itself.

Your task is to implement a program that reads a single integer from standard input and outputs the smallest prime number greater than the given integer. Use efficient methods to check for prime numbers where possible.

inputFormat

The input consists of a single integer (N) provided via standard input.

outputFormat

Output a single integer, which is the smallest prime number greater than (N).## sample

10

11