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())
t = list(map(int,input().split()))
import math
#首先是一个完全平方数
def check_z(n):
    y = int(math.sqrt(n))
    if y * y == n :
        return y
    else :
        return y * y == n

for prime in t:
    yin = check_z(prime)
    if yin == False or yin == 1 :    #判断是否是完全平方数
        print("NO")
        continue
    else :
        for t in range (2,yin):
            if prime % t == 0 :
                print("NO")
                break
        else :
            print("YES")