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.
input()
nums = [int(i) for i in input().split()]
# start = time()
max_num = max(nums)
max_sqrt = 1
while True:
    if max_sqrt**2 >= max_num:
        break
    max_sqrt += 1
primes = {i: 1 for i in range(2, max_sqrt + 1)}
t_primes = {}
for i in range(2, max_sqrt + 1):
    if primes[i]:
        t_primes[i**2] = 1
        for j in range(2, max_sqrt // i + 1):
            primes[i*j] = 0
for i in nums:
    if t_primes.get(i):
        print('YES')
    else:
        print('NO')