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.
useless = input()
result = []
#Primes are True, others are False
#nums[i] shows that if i is a prime
prime = [False, False] +[True] * 999999
for i in range(2, 1000):
    if prime[i]:
        for k in range(i, 1000000, i):
            prime[k] = False
for i in map(int, input().split()):
    sqrt_i = i**(1/2)
    result += [['NO'], ['YES']][int(sqrt_i) == sqrt_i and prime[int(sqrt_i)]]
print('\n'.join(result))