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(x):
    list1=[True]*(x+1)
    list1[0]=list1[1]=False
    for i in range(2,int(x**0.5)+1):
        if list[i]:
            for j in range(i**2,x+1,i):
                list1[j]=False
    return list1

list1=e(10000000)      
def f(x,list1):#质数判断函数
    if x%1==0:
        if x in list1:
            return True
        
    else:
        return False
        
n=int(input())
list2=list(map(int,input().split()))
for i in list2:
    if f(i**0.5,list1)==True and i!=1:
        print('YES')
    else:
        print('NO')     