1728: Prime Test
内存限制:128 MB
时间限制:6.000 S
评测方式:文本比较
命题人:
提交:64
解决:16
题目描述
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
样例输入 复制
2
5
10
样例输出 复制
Prime
2