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 Fri Oct 27 10:51:03 2023

@author: ghp
"""
from math import ceil
n=int(input())
num=list(map(int,input().split()))
r=ceil(max(num))+1
check=[0]*(r+1)
common=set()
for i in range(2,r):
    if check[i]==0:
        common.add(i)
        for j in common:
            if j*i>r:
                break
            check[j*i]=1
        
for x in num:
    a=int(x**0.5)
    if int(x**0.5) in common and x==a*a:
        print('YES')
    else:
        print('NO')