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.
from math import sqrt
def sieve_eratosthenes (n) :
    is_prime = [True] * (n+1)
    is_prime[0] = is_prime[1] = False
    
    for p in range (2 , int(sqrt(n))+1 ) :
        if is_prime[p]:
            for i in range (p*p , n+1 , p) :
                is_prime[i]=False
    return is_prime
    
s = int(input())
numbers = list(map(int,input().split()))

max_value = max(numbers)
primes = sieve_eratosthenes(max_value)

for x in numbers :
    if x < 4:
        print("NO")
    elif int(sqrt(x))**2 == x and primes[int(sqrt(x))]:
        print("YES")
    else :
        print("NO")