#include <bits/stdc++.h>
using namespace std;
bool visited[1000007] = {0};
vector<long long int> prime;
void process() {
  long long int i;
  for (i = 2; i < 1000007; i++) {
    if (visited[i] == 0) {
      visited[i] = 1;
      prime.push_back(i * i);
      for (auto j = i; j < 1000007; j += i) {
        visited[j] = 1;
      }
    }
  }
}
bool flag;
void binary(long long int a, long long int start, long long int end) {
  if (start > end) {
    return;
  }
  long long int mid = (start + end) / 2;
  if (prime[mid] == a) {
    flag = 1;
    return;
  } else {
    if (start == end) {
      return;
    } else {
      if (a < prime[mid]) {
        binary(a, start, mid);
      } else {
        binary(a, mid + 1, end);
      }
    }
  }
}
int main() {
  long long int n, m, temp, curr;
  cin >> n;
  process();
  long long int end = prime.size();
  for (auto i = 0; i < n; i++) {
    cin >> temp;
    flag = 0;
    binary(temp, 0, end);
    if (flag == 0) {
      cout << "NO" << endl;
    } else {
      cout << "YES" << endl;
    }
  }
  return 0;
}
