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.
num=int(input())
ok=[]
A=list(map(int,input().split()))

good=[]
for x in range(3,1000001,2):
    k=int(x**0.5)
    temp=0
    for i in range(2,k+2):
        if x% i==0:
            temp+=1
    if temp==0:
        good.append(x)
whole=[x**2 for x in good]
whole=set(whole)
whole.add(4)
for item in A:
    if item in whole:
        print('YES')
    else:
        print('NO')