A prime number has exactly two divisors: 1 and itself. Read n and print PRIME or NOT PRIME.
Input
One integer 1 ≤ n ≤ 10^9.
Output
PRIME or NOT PRIME. Remember that 1 is not prime.
Hint
You only need to test divisors up to √n.
Read from standard input and write to standard output. 6 test cases in total (4 hidden). Tests for this language run inside your browser.