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.
s={2}
for i in range(2,1000000):
    m=0
    for j in s:
        if i % j ==0:
            m=1
            break
    if m==0:
        s.add(i)
s2=set()
for i in s:
    s2.add(i**2)

n=int(input())
x=list(map(int,input().split()))
for i in range(n):
    if x[i] in s2:
        print("YES")
    else:
        print("NO")

