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.

list=[True for _ in range(10**6)]
primes=[]
for i in range(2,10**6):
    if list[i]==True:
        primes.append(i)
        for j in range(i+i,10**6,i):
            list[j]=False
Tprimes=[x**2 for x in primes]
result=[]
input()
l=[int(y) for y in input().split()]
for num in l:
    if num in Tprimes:
        result.append('YES')
    else:
        result.append('NO')
for r in result:
    print(r)
