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.
#CF_Problem:	230B_T_Prime

import math


def isTPrime(x):
	if x == 4:
		return "YES"
	sqrt = math.sqrt(x)
	
	if x > 8 and sqrt - int(sqrt) == 0:
		for i in range(2, int(math.sqrt(sqrt))+1):
			if sqrt % i == 0:
				return "NO"
		return "YES"

	else:
		return "NO"


n = int(input())
x = list(map(int, input().split()))
for i in x:
	print(isTPrime(i))