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=[]
N=10**6
is_prime=[True]*(N)
is_prime[2]=True
import math
for i in range(2,int(math.sqrt(N))+1):
    if is_prime[i]:
        for j in range(i*i,N,i):
            is_prime[j]=False
for i in range(2,N):
    if is_prime[i]:
        primes.append(i)
n=int(input())
l=input().split()
for i in range(n):
    flag=False
    x=int(l[i])
    y=x**0.5
    if y==int(y):
        if y in primes:
            flag=True
    if flag:
        print("YES")
    else:
        print("NO")