e-olymp
Problems

Prime number?

Prime number?

Check if the given number is prime. The number is prime if it has no more than two divisors: 1 and the number itself.

Input

One positive signed 32-bit integer n.

Output

Print "Yes" if the number is prime, and "No" otherwise.

Time limit 1 second
Memory limit 128 MiB
Input example #1
5
Output example #1
Yes
Input example #2
12
Output example #2
No