# Check if a number is prime

A number is considered prime if itβs divisible by only 2 numbers: 1 and itself.
So, numbers like 3, 7, or 19 are prime (3 is only divisible by 1 and 3, 7 is only divisible by 1 and 7, and 19 is similarly divisible by only 1 and 19). While the numbers 4, 6, 8, or 49 are not prime as they are divisible by other numbers as well (4 is also divisible by 2, 6 is also divisible by 2 and 3, and 49 is also divisible by 7).
Is 1 a prime number?
No - 1 is divisible by only 1. For a number to be prime, it has to be divisible by exactly 2 numbers. So, the smallest prime number is 2.
You are asked to write a program that given a positive integer `n` would decide if itβs a prime number.

#### Input

The first line of the input contains a single integer `n` (1 β€ n β€ ).

#### Output

The program should print `Yes` in case `n` is prime and `No` otherwise.

#### Examples

 Input Output 8 No 7 Yes 1 No 19 Yes
Β

#### Constraints

Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 1 MB