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())
nums=list(map(int,input().split()))
lst=[]
def is_prime(x):
    if x==1:
        return False
    s_lst = [m for m in lst if m in range(2, int(x ** 0.5) + 1)]
    for i in s_lst:
        if x%i==0:
            return False
    return True

def ex_prime(num):
    if num<2:
        return False
    for i in range(2,int(num**0.5)+1):
        if int(num)%i==0:#赋值时用= 验证相等时用==
            return False
    return True
for i in range(2,1001):
    if ex_prime(i):
        lst.append(i)



for a in nums:
    d=a**0.5
    if d%1==0 and is_prime(d):
        print("YES")
    else:
        print("NO")
