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
def judge(a):#生成10^6以内质数表
    b=False
    for i in range(2,math.ceil(math.sqrt(a))+1):#平方数是上限
        if a%i==0:
            b=True
            break
    if b==False:
        l.append(a)

l=[]
l.append(2)
for a in range(3,1000001):
    judge(a)
def ch(i):
    if math.sqrt(i)%1==0 and i!=1 :
        q=int(math.sqrt(i))
        if q in l:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')

n=int(input())
m=list(map(int,input().split()))
for i in m:
    ch(i)