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.
import math
prime=[]
primm=[0]*1000
num=0
for i in range(1,1000):
    val=1
    for j in range(1,num):
        if i%prime[j]==0:
            val=0
            break
    if val:
        prime.append(i)
        primm[i+1]=1
        num+=1
       # print(i)

n=int(input())
b=[int(i) for i in input().split()]
for i in range(n):
    a=b[i]
    val=1
    aa=math.ceil(a**0.5)
    #print(aa)
    if a==1:
        print("NO")
        continue
    if aa*aa==a:
        for j in range(num+1):
            k=prime[j]
            if k==1:
                continue
            if k*k>aa:
                print("YES")
                break
            if aa%k==0:
                print("NO")
                break
    else:
        print("NO")