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.
# LUOGU_RID: 128580319
def ouLaShai(upperBound):                                        
    filter=[False for i in range(upperBound+1)]
    primeNumbers=[]
    for num in range(2,upperBound+1):
        if not filter[num]:
            primeNumbers.append(num)
        for prime in primeNumbers:
            if num*prime>upperBound:
                break
            filter[num*prime]=True
            if num%prime==0:
                break;
    return primeNumbers
#chao de wang shang de, mo ni cheatsheet
a=ouLaShai(10**6)
input()
for i in list(map(int,input().split())):
    if int(i**.5)in a:
        if int(i**.5)**2==i:print('YES');continue
    print('NO')