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.
# -*- coding: utf-8 -*-
"""
Created on Thu Oct 12 14:38:42 2023

@author: 陈亚偲2300011106
"""
from math import sqrt
    
n=int(input())
a=[int(i) for i in input().split()]
p=max(a)
b=[False]+[True]*(p-1)
for i in range(p):
    if b[i]:
        for j in range(2,p//(i+1)+1):
            b[j*(i+1)-1]=False
c=[i+1 for i in range(p) if b[i]]
for i in a:
    if list(str(sqrt(4)))[-2]=='.' and int(sqrt(i)) in c:
        print('YES')
    else:
        print('NO')