Prime Number Checker

Given an integer \(N\), determine whether it is a prime number. A prime number is defined as a natural number greater than 1 that has no positive divisors other than 1 and itself. In other words, a number \(p\) is prime if \(p > 1\) and for any two integers \(a\) and \(b\) such that \(a \times b = p\), either \(a = 1\) or \(b = 1\). This problem requires you to check the primality of \(N\) using an efficient algorithm.

inputFormat

The input is provided via standard input (stdin) and consists of a single integer \(N\) on one line.

outputFormat

Output a single string: "Yes" if \(N\) is a prime number, otherwise "No". The output should be written to standard output (stdout).

7

Yes