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.
prime=[0,0]+[1]*(10**6-1)
l=4
n=int(input())
a=list(map(int,input().split()))
'''while l<10**6:
    k=0
    for i in range(2,int(l**0.5)+2):
        if prime[i]==1:
            if l%i==0:
                k=1
                break
    if k==0:
        prime.append(1)
    else :
        prime.append(0)
    l+=1'''
for i in range(10**3+1):
    if prime[i]==1:
        for j in range(2,10**6//i+1):
            prime[i*j]=0
for item in a:
    if int(item**0.5)**2 ==item :
        if prime[int(item**0.5)]==1:
            print('YES')
        else:
            print('NO')
    elif (int(item**0.5)+1)**2 ==item:
        if prime[int(item**0.5)+1]==1:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')