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 file DATA1.txt will contain a single integer. -1000 <= N <= 1000.

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

-1
        

not
        

1
        

not
        

2
        

prime