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.
import math
#判断是否为完全平方数 不是则pass（参考drunkjailor）
def is_perfect(x):
    sqrt=math.sqrt(x)
    if sqrt.is_integer():
        return True
    else:
        return False
#如果是完全平方数，判断因子个数
def Euler_sieve(n):
    primes = [True for _ in range(n+1)]
    p = 2
    while p*p <= n:
        if primes[p]:
            for i in range(p*p, n+1, p):
                primes[i] = False
        p += 1
    return primes[-1]
def is_T_primes(x):
    set_1=set()
    if not is_perfect(x):
        return False
    if x==4 or x==9:
        return True
    else:
        a=int(math.sqrt(x))
        tuple_basic=(0,2,3,4)
        if a%6 in tuple_basic:
            return False
        else:
            return(Euler_sieve(x))

n=int(input())
int_tuple=tuple(map(int,input().split()))
int_set=set(int_tuple)
dict_1={i:is_T_primes(i) for i in int_set}
for i in int_tuple:
        print("YES" if dict_1[i] else "NO")

