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 -*
#-*- coding: utf-8 -*
'''
Created on Tue Oct 10
author 钱瑞 2300011480
'''
import math

def p(n):
    prime = [True] * (n + 1)
    prime[0]=False
    prime[1]=False
    p = 2
    while p * p <= n:
        if prime[p] == True:
            for i in range(p * p, n+1, p):
                prime[i] = False
        p += 1
    return [i for i in range(n+1) if prime[i] == True]


import math
n=int(input())
l=list(map(int,str(input()).split(' ')))
l_an=[]
for i in l:
    sq=math.sqrt(i)
    if abs(int(sq)-sq)<0.000000001 and p(int(sq+0.000000001)) and i!=1:
        l_an.append('YES')
    else:
        l_an.append('NO')
for i in l_an:
    print(i)