Prime numbers are the numbers which is a multiple of themselves only. You are given a number of integers, take the primality test of each integer.

The purpose of the function is to take the primality test of each integer.

It must return PRIME or NOT PRIME.

Write a function `solve`

which should have the following parameter(s):

1.) *a = an integer to test for primality*

**Example**

Input:

`10`

Output:

After taking the primality test;

`NOT PRIME`

**Explanation**

a = 10 is a multiple of 2, 5, 10.

Input:

`11`

After taking the primality test;

Ouput:

`PRIME`

**Explanation**

a = 11 is only divisible by 1 and itself.

**Constraints**

• The number to test will be greater than 1 and less than 1*10^{5}.