tprime

#include<bits/stdc++.h>
#define ll long long int
using namespace std;
long long int prime[1000001];
void sieve()
{
    prime[1] = 1;
    for(ll i = 2;i<=1000000;i++)
    {
        if(prime[i] == 0)
        {
            for(ll j = i+i;j<=1000000;j+=i)
            {
                prime[j] = 1;
            }
        }
    }
}
int main()
{
    ll n,a;
    cin>>a;

    for(ll i=0;i<a;i++)
    {
        cin>>n;
        ll sqr=0;
        sqr = sqrt(n);
        sieve();
        if(sqr*sqr==n&&prime[sqr]==0)
        {
            cout<<"YES"<<endl;
        }
        else
        {
            cout<<"NO"<<endl;
        }
    }
    return 0;
}