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 sys
input = sys.stdin.readline

n = int(input())
x = list(map(int, input().split()))

sieve = [0]*(10**6+1)

i = 2

while i<=10**6:
	if sieve[i] == 0:
		k = i**2
		while k<=10**6:
			sieve[k] = 1
			k+=i

	i+=1

for i in range(n):
	if x[i]**0.5-int(x[i]**0.5) == 0.0:
		if sieve[int(x[i]**0.5)] == 0:
			print("YES",end='')
		else:
			print("NO",end='')
	else:
		print("NO",end='')
	if i != n-1:
		print()
		

