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.
'''
2300015897
吴杰稀
光华管理学院
'''
def exactly_divided(x,y):
    if x % y == 0:
        return True
    else:
        return False

def is_prime(x):
    if x < 2:
        return False
    else:
        for i in range(2,int(x**(1/2))+1):
            if exactly_divided(x,i):
                return False
        return True

cases = int(input())
num_list = list(map(int,input().split()))
for _ in num_list:
    if _ == (int(_**0.5))**2:
        if is_prime(int(_**0.5)):
            print("YES")
    else:
        print("NO")