Prime Number Check

A prime number is greater than 1 and divisible only by 1 and itself. Checking divisors up to the square root of n is enough.

Implement is_prime(n).

Input

n: The number to test.

Output

Return true if n is prime, otherwise false.

Restricciones

-1,000 ≤ n ≤ 1,000,000,000,000

Ejemplos

Entrada:
n = 29

Salida esperada:
expected = True

Entrada:
long long n = 29;

Salida esperada:
bool expected = true;

Entrada:
long n = 29;

Salida esperada:
bool expected = true;

Entrada:
n = 21

Salida esperada:
expected = False

Entrada:
long long n = 21;

Salida esperada:
bool expected = false;

Entrada:
long n = 21;

Salida esperada:
bool expected = false;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• UW TCSS 142 Introduction to Programming - master syllabus