Time Limit: 6000MS
Memory Limit: 65536K
Given a big integer number, you are required to find out whether it's a prime number.
The first line contains the number of test cases T (1 <= T <= 20 ), then the following T lines each contains an integer number N (2 <= N < 254).
For each test case, if N is a prime number, output a line containing the word "Prime", otherwise, output a line containing the smallest prime factor of N.