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.
#230B：T-primes
def prime(n):
    if n<2:
        return(False)
    if n==2:
        return(True)
    if n%2==0 or n%3==0:
        return(False)
    i=5
    while(i*i<=n):
        if n%i==0 or n%(i+2)==0:
            return False
        i=i+6
    return True
def tprime(n):
    #if prime(n)==True:
        #return("NO")
    if prime(round(n**0.5))==True and round(n**0.5)**2==n:
        return("YES")
    else:
        return("NO")
    
x=int(input())
a=list(map(int,input().split()))
for i in range(x):
    print(tprime(a[i]))