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.
n=int(input())
list1=input().split()

list2=[]
for i in list1:
    i=int(i)
    list2.append(i)

for i in list2:
    if i==1:
        print("NO")
    elif (i**(1/2))%1==0:
        a=int(i**(1/2))
        r="YES"
        for m in range(2,a):
            if a%m==0:
                r="NO"
                break
            else:
                pass
        print(r)
    else:
        print("NO")