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=[]
def generate(m):
    mark=[0]*(m+1)
    for i in range(2,m+1):
        if not mark[i]:
            prime.append(i)
        for k in prime:
            if i*k>=m+1:break
            mark[i*k]=1
            if i%k==0:break
n=int(input())
li=[int(i) for i in input().split()];dict_store={}
m=int(max(li)**0.5);generate(m)#判断质数已经优化
for i in li:
    if i in dict_store:
        print(dict_store[i])
    else:
        if  i**0.5%1==0 and int(i**0.5) in prime:
            print("YES");dict_store[i]="YES"
        else:
            print("NO");dict_store[i]="NO"