DWITE Online Computer Programming Contest, October 2007, Problem 1

In mathematics, a prime number is a natural number which has exactly two distinct natural number divisors: ~1~ and itself. For example: ~2~, ~3~, ~5~, ~7~, ~11~, ~13~, ~17~, ~19~ are the first eight prime numbers. A vanilla flavour programming problem is to figure out if a given number is a prime or not.

The input will contain a single integer. ~-1000 \le N \le 1000~.

The output will contain a single line, stating if the supplied integer is "prime" or "not". Use the exact string output, all lower case, without quotes.

Sample Input 1

-1

Sample Output 1

not

Sample Input 2

1

Sample Output 2

not

Sample Input 3

2

Sample Output 3

prime

Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) Problem Resource: DWITE