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())
t=[int(x) for x in input().split()]
prime=[0 for i in range(2000000)]
prime[1]=1
def SieveOfEratosthenes(n):
    for i in range(2,n+1):
        for j in range(i,n+1):
            prime[i*j]=1
SieveOfEratosthenes(1001)
for _ in range(_n):
    s=int(t[_]**0.5)
    if s**2==t[_] and t[_]!=1:
        if prime[s]==0:
            print("YES")
        else:
            print("NO")
    else:
        print("NO")