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.
from math import sqrt
prime = []
is_prime = [0] * 100001
n = int(input())
for i in range(2, 100000):
    if not is_prime[i]:
        prime.append(i)
    for p in prime:
        if i * p >= 100000:
            break
        is_prime[i * p] = 1
        if i % p == 0:
            break

input_num = list(map(int, input().split()))

for num in input_num:
    if sqrt(num) % 1 != 0:
        print('NO')         # 不是平方数
    else:
        if not is_prime[int(sqrt(num))]:
            print('YES')
        else:
            print('NO')

