Prime Numbers(简单)

Description

Given an integer number, you are required to find out whether it's a prime number.

Input

The first line contains the number of test cases T (1 <= T <= 20 ), 

then the following T lines each contains an integer number N (0 < N < 4,000,000,000).

Output

For each test case, if N is a prime number, output a line containing the word "Prime", 

otherwise, output the word "No".

Sample Input

35103999999997

Sample Output

PrimeNoNo

代码