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 = 10**6
is_prime = [True] * (N+1)  
is_prime[0] = is_prime[1] = False 
for i in range(2, int(math.sqrt(N)+1)):
    if is_prime[i]:
        for j in range(i*i, N+1, i):
            is_prime[j] = False

primes = [i for i in range(2, N+1) if is_prime[i]]

n=int(input())
num=list(map(int,input().split()))
for i in range(n):
    nu=math.sqrt(num[i])
    nus=int(nu)
    nu=str(nu)
    if nu[-1]=='0' and nu[-2]=='.' and nus in primes:
        print('YES')
    else:
        print('NO')
        