## Primes 3

Given `T` (1 ≤ `T` ≤ 100) positive integers, one per line, determine whether each one is prime. The integers will be no greater than 2^{63}−1.

The first line of input will be the integer `T`. The next `T` lines each contain a number to be tested.

For each of the `T` integers, you should output on a separate line `PRIME`

if the corresponding integer is prime, or `NOT`

if it is composite.

### Sample Input

5 1 2 6 11 1000000000000000000

### Sample Output

NOT PRIME NOT PRIME NOT

All Submissions

Best Solutions

**Point Value:** 20 (partial)

**Time Limit:** 2.00s

**Memory Limit:** 16M

**Added:** Jan 03, 2014

**Author:** Alex

**Languages Allowed:**

C++03, PAS, C, ASM, C++11

## Comments (Search)

Paradoxon Aug 17, 2016 - 3:46:09 am UTC Awesomegirishr2004on Dec 27, 2015 - 4:16:06 pm UTCr3markon Dec 27, 2015 - 4:53:49 pm UTC Re: ...Venkat24on Jan 20, 2016 - 11:57:55 pm UTC Re: ...spencereiron Jan 21, 2016 - 7:21:14 pm UTC Re: ...Kiritoon Mar 16, 2016 - 5:06:05 am UTC Re: ...