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.
t=int(input(""))
L=list(map(int,input().split()))

L1=[]
for j in range(2,1000001):
    c=False 
    for k in range(2,j):
        if(k*k>j):
            break  
        
        if(j%k==0):
            c=True
            break  
        
    if(c==False):
        L1.append(j*j)
        
for j in range(0,t):
    if(L[j] in L1):
        print("YES")
        
    else:
        print("NO")