#include <bits/stdc++.h>
using namespace std;
vector<int> primefactors(int n) {
  vector<int> ans;
  while (n % 2 == 0) {
    ans.push_back(2);
    n = n / 2;
  }
  for (int i = 3; i * i <= n; i += 2) {
    while (n % i == 0) {
      ans.push_back(i);
      n = n / i;
    }
  }
  if (n > 2) {
    ans.push_back(n);
  }
  return ans;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> ans = primefactors(n);
    int count = 1;
    vector<int> un;
    un.push_back(ans[0]);
    int temp = 0;
    for (int i = 1; i < ans.size(); i++) {
      if (temp == 0) {
        temp = ans[i];
      } else {
        temp *= ans[i];
      }
      if (temp != un[i - 1]) {
        un.push_back(temp);
        break;
      }
    }
    if (un.size() != 2) {
      cout << "NO" << endl;
    } else {
      int num1 = un[0], num2 = un[1];
      int num3 = n / (num1 * num2);
      if (num3 == 1 || num3 == num2 || num1 == num3) {
        cout << "NO" << endl;
      } else {
        cout << "YES" << endl;
        cout << num1 << " " << num2 << " " << (n / (num1 * num2)) << endl;
      }
    }
  }
}
