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.
M = 1000000
Num = [True]*M
su = []
for i in range(M):
    if Num[i]==True:
        su.append(i+2)
    index = 0
    while index<len(su) and (i+2)*su[index]-2<M :
        Num[(i+2)*su[index]-2]=False
        if (i+2)%su[index]==0:
            break
        index+=1

n = int(input())
s = input().split()
for i in range(len(s)):
    l=float(s[i])**0.5
    if l==int(l) and Num[int(l)-2]==True:
        print("YES")
    else:
        print("NO")