Problem: 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.

Input

The first line contains a single positive integer, n (1 ≤ n ≤ 105), showing how many numbers are in the array. The next line contains n space-separated integers xi (1 ≤ xi ≤ 1012).

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.

Output

Print n lines: the i-th line should contain "YES" (without the quotes), if number xi is Т-prime, and "NO" (without the quotes), if it isn't.

Examples

Input

3
4 5 6


Output

YES
NO
NO

Note

The given test has three numbers. The first number 4 has exactly three divisors — 1, 2 and 4, thus the answer for this number is "YES". The second number 5 has two divisors (1 and 5), and the third number 6 has four divisors (1, 2, 3, 6), hence the answer for them is "NO".

Solution (in PYTHON3):

Solution:
'''#def check(i):
#    
#    count =1
#    for j in range(3,i//2+1,2):
#        if i%j==0:
#            count+=1
#        if count>3:
#            return "NO"
#    if count==2:
#        return "YES"
#    else:
#        return "NO"

n=int(input())
l=[*map(int,input().split())]
#for i in l:
#    if i&1==1:
        print(check(i))
    elif i&1==0 and i==4:
        print("YES")
    else:
        print("NO")
'''

'''def seive(n):
    s=set()
    se =[False]*(n+1)
    #s.add(4)
    #se[2]=False
    factor=2
    while factor<=n:
        if se[factor]==True:
            factor+=1
            continue
        if se[factor]==False:
            s.add(factor*factor)
            k=factor
            while k*k<=n:
                se[k]=True
                k+=k
            factor+=1
    return s 
s=seive(10**6)'''
N=1000000
n=int(input())
l=[*map(int,input().split())]
a=[1]*N
a[0]=a[1]=0
s=set()
for i in range(2,N):
    if a[i]:
        s.add(i*i)
        for j in range(i+i,N,i):
            a[j]=0       
for i in l:
    if i in s:
        print("YES")
    else:
        print("NO")