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.
#author 沈天健 2300011417
import sys
readline=sys.stdin.readline
write=sys.stdout.write
n=int(readline())
lis=[*map(int,readline().split())]

prime=[]
is_prime=[True]*1100000
def oula_shai():
    is_prime[0]=False
    is_prime[1]=False
    for i in range(2,1000001):
        if is_prime[i]:
            prime.append(i)
        for pri in prime:
            is_prime[pri*i]=False
            if i%pri==0:
                break

for x in lis:
    if int(x**0.5)==x**0.5:
        if is_prime[int(x**0.5)]:
            write("YES\n")
            continue
    write("NO\n")
    

