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.
def E(n):
    primes=[]
    judge=[0 for i in range(n+1)]
    for i in range(2,n+1):
        if judge[i]==0:
            primes.append(i)
        for p in primes:
            if i*p>n:
                break
            judge[i*p]==1
            if i%p==0:
                break
    return primes
            
n=int(input())
for x in map(int,input().split()):
    if x**0.5 in E(10**6):
        print("YES")
    else:
        print("NO")