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())
def judge(num):
    count=0
    for t in range(1,int(num**0.5)+1):
        answer='NO'
        if num%t==0:
            count+=1
        count=count*2
        if num**0.5%1==0:
            count-=1
        else:
            continue
        if count==n:
            answer='YES'
    print (answer)
num=[int(k) for k in input().split()]
for i in range(n):
    judge(num[i])