Skip to content
UPEEC

Is It Prime?

Easy#basics#math#primes· solved by 0 · time limit 2.0 s

Print Yes if nn is a prime number and No otherwise. A prime has exactly two divisors: 1 and itself.

Input

A single integer nn.

Output

Yes or No.

Constraints

0≤n≤10120 \le n \le 10^{12} — checking divisors up to n\sqrt n is fast enough.

Sample 1

Input

7

Output

Yes

Sample 2

Input

12

Output

No

Sign in or join free to run and submit your solution.