#include <bits/stdc++.h>
using namespace std;
const long long N = 1e12 + 9;
long long isPrime(long long n) {
  if (n < 2) return 0;
  if (n == 2) return 1;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  long long n;
  cin >> n;
  set<long long> sqr;
  for (long long i = 1; i * i < N; i++) {
    sqr.insert(i * i);
  }
  while (n--) {
    long long x;
    cin >> x;
    if (sqr.find(x) == sqr.end()) {
      cout << "NO\n";
      continue;
    }
    long long root = sqrt(x);
    while (root * root < x) root++;
    while (root * root > x) root--;
    if (isPrime(root))
      cout << "YES";
    else
      cout << "NO";
    cout << "\n";
  }
}
