We know that prime numbers are positive integers that have exactly two distinct positive divisors. Similarly, we'll call a positive integer *t* Т-prime, if *t* has exactly three distinct positive divisors.

You are given an array of *n* positive integers. For each of them determine whether it is Т-prime or not.
The first line contains a single positive integer, *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>), showing how many numbers are in the array. The next line contains *n* space-separated integers *x*<sub class="lower-index">*i*</sub> (1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">12</sup>).

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is advised to use the cin, cout streams or the %I64d specifier.
import math
num=[1]*1000000
l=set()
for i in range(2,1000000):#不开方，生成质数表，只要遍历区间内任意数的任意大于1的倍数并否认它是质数，剩下的数就全是质数
    if num[i]:
        l.add(i)
        for j in range(i,1000000,i):
            num[j]=0

n=int(input())
m=list(map(int,input().split()))
for i in m:
    print(['NO','YES'][math.sqrt(i) in l])