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.
'''
刘思瑞 2100017810
'''
def euler(n):
    filter, primers = [False for i in range(n + 1)], []
    for i in range(2, n + 1):
        if not filter[i]:
            primers.append(i)
        for prime in primers:
            if i * prime > n:
                break
            filter[i * prime] = True
            if i % prime == 0:
                break
    return primers

def search(num):
    global prime_
    sq = int(num**(0.5))
    if int(sq**2) != num or num == 1:
        return 'NO'
    if sq in prime_:
        return 'YES'
    return 'NO'

n = int(input())
num = list(map(int,input().split()))
n = int(max(num)**(0.5))
prime_ = euler(n)
for i in num:
    print(search(i))
