Problem 1014 --判定素数 (Judging prime number)

1014: 判定素数 (Judging prime number)

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 150  Solved: 18
[Submit][Status][Web Board]

Description

判定一个数是否是给定范围(1<=m<=10000)内的素数

Determine whether a number is a prime number within a given range (1<=m<=10000)

Input

输入第一行为一个数字n(1<n<10000),接下来表示n个备选数字,以回车分割 

要求判定给定的n个数字是否为给定范围(1<=m<=10000)内的素数


The first line of the input is a number n (1<n<10000) , followed by n numbers, separated by carriage return 


It is required to determine whether the given n numbers are prime numbers (1<=m<=10000)

Output

如果是范围内的素数则输出“true”,否则输出“false”


Output "true" if it is a prime number, otherwise output "false"

Sample Input

7
5645
5698
7569
5872
3659
5648
6589

Sample Output

false
false
false
false
true
false
false

HINT

Source

 

[Submit][Status]