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 Sieve_of_Eratosthenes(x):
    numbers=[True]*(x + 1)
    numbers[0]=numbers[1]=False
    for i in range(2,int(x**0.5)+1):
        if numbers[i]:
            j=i*i
            while j <= x:
                numbers[j]=False
                j+=i
    return numbers
def judge(num):
    if (num**0.5)%1!=0 :
        answer='NO'
    else:
        answer='NO'
        b=num**0.5
        if Sieve_of_Eratosthenes(b):
            answer='YES'
    print (answer)
num=[int(k) for k in input().split()]
for i in range(n):
    judge(num[i])