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.
#230B：T-primes
import math
def tprime(n):
    s=int(math.sqrt(n))
    if s in prime and s**2==n:
        return("YES")
    return("NO")
#建立质数集合
max_num=int(math.sqrt(10**12))
prime=set()
is_prime=[True]*(max_num + 1)
is_prime[0]=is_prime[1]=False
for i in range(2, int(math.sqrt(max_num)) + 1):
    if is_prime[i]==True:
        for j in range(i*i, max_num + 1, i):
            is_prime[j]=False
for i in range(max_num + 1):
    if is_prime[i]==True:
        prime.add(i)

# 判断每个数是否为T-质数
x=int(input())
a=list(map(int,input().split()))
for i in range(x):
    print(tprime(a[i]))