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.
a=int(input())
d=list(map(int,input().split()))
for i in range(a):
    l=[]
    gg=0
    ff=2
    kk=0
    for j in range(d[i]):
        l.append(j)
    l[1]=0
    while(ff<len(l)**0.5):
        if(l[ff]!=0):
            gg=ff**2
            while gg<len(l):
                l[gg]=0
                gg=gg+ff
        ff=ff+1
    while (0 in l):
        l.remove(0)
    for hh in l:
        if(hh**2==d[i]):
            kk=1
            break
    if(kk==1):
        print("YES")
    else:
        print("NO")
