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 ceil, sqrt
tp = []
primes = [2, 3, 5, 7]

def extendPrimes(a):
    p = primes[-1]
    while primes[-1] <= a:
        newp = p+2
        flag = False
        sqnp = ceil(sqrt(newp))
        for prime in primes:
            if prime<= sqnp and newp%prime == 0:
                flag = True
                break
        p = newp
        if not flag: primes.append(p)
        
def isPrime(a):
    if a<primes[-1]: extendPrimes(a)
    if a in primes: return True
    return False

def func(a):
    if a==1: return 'NO'
    if a in tp: return 'YES'
    if sqrt(a) == int(sqrt(a)):
        if isPrime(int(sqrt(a))):
            tp.append(a)
            return 'YES'
    return 'NO'

n = int(input())
A = list(map(int, input().split()))
for a in A:
    print(func(a))