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;
int main() {
  int tst;
  long long n, a, b, c;
  vector<long long> v;
  bool flag;
  cin >> tst;
  while (tst--) {
    flag = false;
    cin >> n;
    for (int i = 2; i <= sqrt(n); i++) {
      if (n % i == 0) {
        v.push_back(i);
        n /= i;
      }
      if (v.size() == 2) {
        v.push_back(n);
        if (v[0] != v[1] && v[1] != v[2]) flag = true;
        break;
      }
    }
    if (flag) {
      cout << "YES" << endl;
      sort(v.begin(), v.end());
      cout << v[0] << " " << v[1] << " " << v[2] << endl;
    } else
      cout << "NO" << endl;
    v.clear();
  }
  return 0;
}