Drop links or images here to add them to the editor.

Prime Function

Create a function named esPrimo.

The function must receive an integer and return true if the number is prime. If it is not prime, it must return false.

A prime number is a number greater than 1 that is only divisible by 1 and itself.

Required function

bool esPrimo(int n)

Input

An integer.

Output

true if the number is prime.

false if the number is not prime.

Examples

Input:

7

Output:

true

Input:

12

Output:

false