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 prime_sieve(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = is_prime[1] = False
    p = 2
    while p * p <= n:
        if is_prime[p]:
            for i in range(p * p, n + 1, p):
                is_prime[i] = False
        p += 1

    return is_prime #返回n范围内所有质数列表


def is_perfect_square_and_sqrt_prime(n):
    sqrt_n = int(math.sqrt(n))
    sieve=prime_sieve(sqrt_n) #sieve是获取输入sqrt_n后返回的列表
    if sqrt_n * sqrt_n == n and sieve[sqrt_n]:
        return True
    return False

n=int(input())
l=list(map(int,input().split()))

for i in l:
    if is_perfect_square_and_sqrt_prime(i):
        print('YES')
    else:
        print('NO')