Problem: You are given one integer number n. Find three distinct integers a, b, c such that 2 ≤ a, b, c and a ⋅ b ⋅ c = n or say that it is impossible to do it.

If there are several answers, you can print any.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 100) — the number of test cases.

The next n lines describe test cases. The i-th test case is given on a new line as one integer n (2 ≤ n ≤ 10^9).

Output

For each test case, print the answer on it. Print "NO" if it is impossible to represent n as a ⋅ b ⋅ c for some distinct integers a, b, c such that 2 ≤ a, b, c.

Otherwise, print "YES" and any possible such representation.

Example

Input


5
64
32
97
2
12345


Output


YES
2 4 8 
NO
NO
NO
YES
3 5 823 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long int j, pri[100005], i;
vector<long long int> prime;
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, tmp, cnt = 0, prod = 1;
    cin >> n;
    tmp = n;
    unordered_set<long long int> st;
    for (i = 2; i <= ceil(sqrt(tmp)); i++) {
      if (n % i == 0) {
        st.insert(i);
        n /= i;
        cnt++;
        prod *= i;
        if (cnt == 2) break;
      }
    }
    if (cnt < 2) {
      cout << "NO\n";
      continue;
    }
    long long int lst = tmp / (prod);
    if (lst != 1) {
      st.insert(lst);
      if (st.size() == 3) {
        cout << "YES\n";
        for (auto it = st.begin(); it != st.end(); it++) cout << *it << " ";
        cout << "\n";
      } else
        cout << "NO\n";
    } else
      cout << "NO\n";
  }
  return 0;
}