#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);
}
bool isPrime(long long n) {
  long long root = sqrt(n) + 1;
  for (long long i = 2; i <= root; i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  long long tt;
  cin >> tt;
  while (tt--) {
    long long n;
    cin >> n;
    if (isPrime(n)) {
      cout << "NO"
           << "\n";
      continue;
    }
    long long cube = cbrt(n) + 1;
    long long a, b, c;
    bool flag = false;
    for (long long i = 2; i <= cube; i++) {
      for (long long j = i + 1; 1; j++) {
        long long vagfol = (n) / (i * j);
        long long vagses = (n) % (i * j);
        if (!vagses) {
          if (j != vagfol && i != vagfol && vagfol >= 2) {
            flag = true;
            a = i, b = j, c = vagfol;
            break;
          }
        }
        if (vagfol < j) {
          break;
        }
      }
      if (flag) break;
    }
    if (flag) {
      cout << "YES"
           << "\n";
      cout << a << " " << b << " " << c << "\n";
    } else
      cout << "NO"
           << "\n";
  }
  return 0;
}
