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.
def judge(x):    #判断它是不是质数的完全平方
    z=x**0.5
    if x == 1:   #排除1！！！
        return 'NO'
    if round(z,5) != z:   #判断是不是完全平方
        return 'NO'
    y=int(z)**0.5     #判断z是不是质数(只需要找到根号y即可)
    if  z != 2 and z % 2 == 0:
        return 'NO'
    for i in range(3,int(y)+1,2):
        if z % i == 0:
            return 'NO'
    return 'YES'

n=int(input())
l=list(map(int,input().split()))
for i in l:
    print(judge(i))