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
def primes_sieve(limit):
    limitn = limit+1
    not_prime = [False] * limitn
    for i in range(2, limitn):
        if not_prime[i]:
            continue
        for f in range(i*2, limitn, i):
            not_prime[f] = True
        if i == g:
            return True
    else:
        return False
a = int(input())
b = list(map(int,input().split()))
for ti in b:
	if math.sqrt(ti).is_integer():
		g = int(math.sqrt(ti))
		if primes_sieve(g):
			print('YES')
		else:
			print('NO')
	else:
		print('NO')
