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 linear_sieve(n):
    is_prime = [True] * (n+1)
    primes = []

    for i in range(2, n+1):
        if is_prime[i]:
            primes.append(i)
        
        j = 0
        while j < len(primes) and i * primes[j] <= n:
            is_prime[i * primes[j]] = False

            if i % primes[j] == 0:
                break
            j += 1

    return is_prime

is_prime=linear_sieve(1000000)
n=int(input())
a=list(map(int,input().split()))
for i in a:
    x=int(sqrt(i))
    if i == 1:
        print('NO')   
    elif x**2!=i or is_prime[x]==0:
        print("NO")
    else:
        print("YES")