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.

Vincoli

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

Esempi

Input:
n = 29

Output atteso:
expected = True

Input:
long long n = 29;

Output atteso:
bool expected = true;

Input:
long n = 29;

Output atteso:
bool expected = true;

Input:
n = 21

Output atteso:
expected = False

Input:
long long n = 21;

Output atteso:
bool expected = false;

Input:
long n = 21;

Output atteso:
bool expected = false;

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

• UW TCSS 142 Introduction to Programming - master syllabus