#include <bits/stdc++.h>
using namespace std;
long long myCeil(long long num, long long divider) {
  long long result = num / divider;
  if ((result * divider) == num) return result;
  return result + 1;
}
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
int main() {
  ios_base::sync_with_stdio(false);
  long long tt;
  cin >> tt;
  while (tt--) {
    long long n;
    cin >> n;
    long long limit = sqrt(n) + 1;
    vector<long long> V;
    long long tempN = n;
    for (long long i = 2; i <= limit; i++) {
      if (tempN % i == 0) {
        V.push_back(i);
        tempN /= i;
        if (V.size() == 2) {
          V.push_back(tempN);
          break;
        }
      }
    }
    if (V.size() == 3) {
      if (V[1] < V[2]) {
        cout << "YES"
             << "\n";
        for (long long i = 0; i < 3; i++) {
          cout << V[i] << " ";
        }
        cout << "\n";
        continue;
      }
    }
    cout << "NO"
         << "\n";
  }
  return 0;
}
