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 isPrime(a):
    if a in primes: return True
    if a%2 == 0: return False
    fac = 3
    while fac <= ceil(a**0.5):
        if a%fac==0: return False
        fac+=2
    primes.append(a)
    return True

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))):
            return 'YES'
    return 'NO'

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