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.

n = int(input())
arr = list(map(int, input().split()))

def SieveOfEratosthenes(n):
# Create a boolean array
    primeNumber = [True for i in range(n+2)]
    i = 2
    while (i * i <= n):
        if (primeNumber[i] == True):
            for j in range(i * i, n+1, i):
                primeNumber[j] = False
        i += 1
    return primeNumber
prime = SieveOfEratosthenes(10**5)
spri = []
for i in range(2,len(arr)):
    if prime[i]:
        spri.append(pow(i,2))


for i in arr:
    if i in spri:
        print("YES")
    else:
        print("NO")
