/* -*- coding: utf-8 -*-
 *
 * 2751.cc:  No.2751 429-like Number - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_P = 100000 + 100;

/* typedef */

typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;

/* global variables */

vb primes;
vi pnums;

/* subroutines */

int gen_primes(int maxp) {
  primes.assign(maxp + 1, true);
  primes[0] = primes[1] = false;

  int p;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums.push_back(p);
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums.push_back(p);
  return (int)pnums.size();
}

int prime_decomp(ll n) {
  int cnt = 0;

  for (auto pi: pnums) {
    if ((ll)pi * pi > n) {
      if (n > 1) cnt++;
      break;
    }
    while (n % pi == 0) n /= pi, cnt++;
  }

  return cnt;
}

/* main */

int main() {
  gen_primes(MAX_P);

  int tn;
  scanf("%d", &tn);

  while (tn--) {
    ll ai;
    scanf("%lld", &ai);
    
    if (prime_decomp(ai) == 3) puts("Yes");
    else puts("No");
  }
  
  return 0;
}