#include <bits/stdc++.h>
using namespace std;
using std::vector;
int isPrime(unsigned long long int n) {
  if (n <= 1) return 0;
  if (n <= 3) return 1;
  if (n % 2 == 0 || n % 3 == 0) return 0;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return 0;
  return 1;
}
int t_prime(vector<long long int> &num) {
  for (int i = 0; i < num.size(); i++) {
    long long int temp = num[i];
    long long int start = 0;
    long long int end = num[i] / 2;
    int result = 0;
    if (temp == 0 || temp == 1) result = 0;
    if (temp > 4 && temp % 2 == 0)
      result = 0;
    else {
      while (start <= end) {
        long long int mid = (start + end) / 2;
        unsigned long long int prod = mid * mid;
        if (prod == temp) {
          if (isPrime(mid) == 1) result = 1;
          break;
        }
        if (prod < temp) {
          start = mid + 1;
        } else {
          end = mid - 1;
        }
      }
    }
    if (result == 1)
      cout << "YES"
           << "\n";
    else
      cout << "NO"
           << "\n";
  }
  return 0;
}
int main() {
  int n;
  cin >> n;
  vector<long long int> num(n);
  for (size_t i = 0; i < num.size(); ++i) {
    cin >> num[i];
  }
  int result;
  t_prime(num);
  return 0;
}
