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.
'''程文奇 2100015898'''
def prime(x):
    for i in range(2,int(x**0.5)+1):
        if x%i==0:
            return False
    return True

def Tprime(x):
    h=x**0.5
    if int(h)==h and prime(h)==True:
        return 'YES'
    return 'NO'

n=int(input())
answerlist=list(map(lambda x:Tprime(int(x)),input().split()))
for j in range(n):
    print(answerlist[j])