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.
import math
def oulashai(n):
    prime = []
    is_prime = [True] * (n + 1)
    for i in range(2,n + 1):
        if is_prime[i]:
            prime.append(i)
        for j in range(len(prime)):
            if i * prime[j] > n:
                break
            is_prime[i * prime[j]] = False
            if i % prime[j] == 0:
                break
    return prime

new_set = set(oulashai(100000))
cases = int(input())
num_list = list(map(int,input().split()))
for i in range(cases):
    if math.sqrt(num_list[i]) == int(math.sqrt(num_list[i])):
        print("YES")
    else:
        print("NO")