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.
'''
刘思瑞 2100017810
'''
def search(num):
    sq = int(num**(0.5))
    if int(sq**2) != num or num == 1:
        return 'NO'
    for i in range(2,int(sq**(0.5)+1)):
        if sq % i == 0:
            return 'NO'
    return 'YES'

n = int(input())
num = list(map(int,input().split()))
for i in num:
    print(search(i))
