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 judgePri(N):
    isPrime = [True] * N
    primes = []
    cnt = 0
    isPrime[1] = False
    for i in range(2, N):
        if isPrime[i]:
            primes.append(i)
            cnt += 1
        for j in range(cnt):
            temp = i * primes[j]
            if temp >= N:
                break
            isPrime[temp] = False
            if i % primes[j] == 0:
                break
    return isPrime
# 判断一个数是否为素数
def is_prime(n):
    if n < 2:
        return False
    return isPrime[n]

t=int(input())
nums=list(map(int,input().split()))
n=max(nums)
isPrime= judgePri(int(math.sqrt(n))+1)
# print(prime)
for x in nums:
    r=int(x**0.5)
    if r**2!=x:
        print("NO")
    else:
        if is_prime(r):
            print("YES")
        else:
            print("NO")