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.
primes = [2]

def judge(N):#质数表范围覆盖N时的情况
    for prime in primes:
        if prime**2 > N:
            return True
        elif N % prime == 0:
            return False
    return True

def append(N):#质数表范围未覆盖N时的情况
    global primes
    for number in range(primes[-1]+1,N+1):
        if judge(number):
            primes.append(number)

def isPrime(N):
    if primes[-1]**2 >= N:
        return judge(N)
    else:
        append(N)
        return judge(N)
    
n = int(input())
number_list = list(map(int,input().split()))
for number in number_list:
    squ = int(number**(1/2))
    if squ**2 == number and isPrime(squ):
        print('YES')
    else:
        print('NO')