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 Sat Oct 14 21:00:52 2023

@author: 2300011376
"""

N=int(input())
lis=list(input().split())
for i in range(0,N):
    lis[i]=int(lis[i])
M=max(lis)
mp=[0]*(M+1)
np=[0]*(M+1)
mp[1]=1
for i in range(2,M+1):
    if mp[i]==0:
        mp[i]=i
        np[i]=1
        for j in range(i*2,M+1,i):
            if mp[j]==0:
                mp[j]=i
        np[j]=np[int(j/mp[j])]+1
for i in lis:
    if int(i**0.5)**2==i:
        x=int(i**0.5)
        if np[x]==1:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')
    