1. You've to check whether a given number is prime or not. 2. Take a number "t" as input representing count of input numbers to be tested. 3. Take a number "n" as input "t" number of times. 4. For each input value of n, print "prime" if the number is prime and "not prime" otherwise.
Input Format
A number t A number n A number n .. t number of times
Output Format
prime not prime not prime .. t number of times
Constraints
1 <= t <= 10000 2 <= n < 10^9
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
5 13 2 3 4 5
Output
prime prime prime not prime prime