#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <typename T>
string to_str(T str) {
  stringstream stream;
  stream << str;
  return stream.str();
}
template <typename T>
int to_int(T num) {
  int val;
  stringstream stream;
  stream << num;
  stream >> val;
  return val;
}
vector<string> split(const string& s, char delim) {
  vector<string> elems;
  stringstream ss(s);
  string item;
  while (getline(ss, item, delim)) elems.push_back(item);
  return elems;
}
bool comp(const pair<int, int>& i, const pair<int, int>& j) {
  return i.second < j.second;
}
long int setbit(long int n, long int pos) { return n = n | (1 << pos); }
long int resbit(long int n, long int pos) { return n = n & ~(1 << pos); }
bool checkbit(long long int n, long long int pos) {
  return (bool)(n & (1ll << pos));
}
long long int bigmod(long long int b, long long int p, long long int m) {
  if (p == 0) return 1;
  long long int ret = bigmod(b, p / 2, m);
  ret = (ret * ret) % m;
  if (p & 1) ret = (ret * b) % m;
  return ret;
}
const int dr[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dc[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int T2 = 105;
const int T3 = 1005;
const int T4 = 10005;
const int T5 = 100005;
int i = 0, j = 0, k = 0, t = 0, n;
int prime[1000005];
void pre() {
  prime[0] = 1, prime[1] = 1;
  for (int i = 2; i * i < 1000005; i++) {
    for (int j = i * i; j < 1000005; j = j + i) prime[j] = 1;
  }
}
int main() {
  pre();
  scanf("%d", &n);
  long long int x, t;
  for (int i = 0; i < (n); i++) {
    cin >> x;
    t = sqrt(x);
    if (prime[t] == 0 && t * t == x)
      printf("YES\n");
    else
      printf("NO\n");
  }
}
