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.
#2300015804
n = int(input())
ans = ["YES"] * n
m = 0
nums = []
for _ in range(n):
    num = int(input())
    nums.append(num)
    if (num ** 0.5) % 1 - 1 <= 0.00000001:
        ans[_] = "YES"
        m = max(m, int(num ** 0.5))

judge = [0] * 2 + [1] * (m - 1)
t_prime = []
for i in range(2, m + 1):
    if judge[i] == 0:   continue
    now = 2 * i
    while now <= m:
        judge[now] = 0
        now += i
for j in range(2, m + 1):
    if judge[j] == 1:   t_prime.append(j * j)

for k in range(n):
    if ans[k] == "YES":
        if nums[k] not in t_prime:  ans[k] = "NO"

for l in range(n):
    print(ans[l])
