#include <bits/stdc++.h>
using namespace std;
vector<long long> vec;
void primeFactors(long long n) {
  while (n % 2 == 0) {
    vec.push_back(2);
    n = n / 2;
  }
  for (long long i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      vec.push_back(i);
      n = n / i;
    }
  }
  if (n > 2) vec.push_back(n);
}
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n, i;
    cin >> n;
    primeFactors(n);
    if (vec.size() < 3) {
      cout << "NO" << endl;
    } else {
      set<long long> s;
      s.insert(vec[0]);
      long long x = 1;
      for (i = 1; i < vec.size(); i++) {
        x *= vec[i];
        if (x != vec[0]) break;
      }
      s.insert(x);
      x = (n / x) / vec[0];
      if (x != 1) s.insert(x);
      if (s.size() == 3) {
        cout << "YES" << endl;
        for (auto it = s.begin(); it != s.end(); it++) {
          cout << *it << " ";
        }
        cout << endl;
      } else {
        cout << "NO" << endl;
      }
    }
    vec.clear();
  }
  return 0;
}
