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
res=[]
n=int(input())
x=list(map(int,input().split()))
N=1000001

prime = [True for i in range(N+1)] 
p = 2
while (p * p <= N):  
    if (prime[p] == True):  
        for i in range(p * p, N+1, p):          
            prime[i] = False
    p += 1
for e in x:
    r=int(math.sqrt(e))
    if r*r==e and prime[r]:
        print('YES')
    else:
        print('NO')