#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
ll mm(ll a,ll b,ll M){
    if(a<INF&&b<INF)return (a*b)%M;
    ll v(0),w(a%M);
    while(b)v=b&1?(v+w)%M:v,w=(w<<1)%M,b>>=1;
    return v%M;
}
ll pw(ll n,ll k,ll M){
    ll r=1;
    while(k){
        if(k&1)r=mm(r,n,M);
        n=mm(n,n,M),k>>=1;
    }
    return r%M;
}
ll rnd(int b){ll r(0);F(b)r<<=1,r|=rand()&1;return r;}
bool isP(ll n){
    ll h(ceil(log2(n)-ZERO)),a;
    F(10){
        a=rnd(h)%(n-1)+1;
        if(pw(a,n-1,n)-1)return 0;
    }
    return 1;
}
int main(void){
    ll N;
    IN(tt)F(tt)
        scanf("%lld",&N),
        puts(isP(N)?"YES":"NO");
}