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
N=100000000001
y=[1 for _ in range(N)]
y[1]=0
for i in range(2,N):
    if y[i]==1:
        for j in range(i+i,N,i):
            y[j]=0
n=int(input())
x=list(map(int,input().split()))
for i in range(n):
    a=int(math.pow(x[i],0.5))
    if a*a==x[i] and y[a]:
        print('YES')
    else:
        print('NO')