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 JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    static int mod=(int)1e9+7;
    public static void main(String[] args) throws IOException {
        FastReader sc = new FastReader();
        int t=sc.nextInt();
        while (t-->0){
            int n=sc.nextInt();
            HashMap<Integer,Integer> hm= fac(n);
            int[] arr1=new int[hm.size()];
            int[] arr2=new int[hm.size()];
            int count=0;
            for (int x:hm.keySet()){
                arr1[count]=x;
                arr2[count]=hm.get(x);
                count++;
            }
            if (count>=3){
                System.out.println("YES");
                System.out.println(arr1[0]+" "+arr1[1]+" "+n/(arr1[0]*arr1[1]));
            }else if (count==2){
                if (arr2[0]+arr2[1]>=4){
                    System.out.println("YES");
                    System.out.println(arr1[0]+" "+arr1[1]+" "+(n/(arr1[0]*arr1[1])));
                }else System.out.println("NO");
            }else{
                if (arr2[0]>=6){
                    System.out.println("YES");
                    System.out.println(arr1[0]+" "+(arr1[0]*arr1[0])+" "+(n/(arr1[0]*arr1[0]*arr1[0])));
                }else System.out.println("NO");
            }
        }
    }
    static HashMap<Integer, Integer> fac(int x){
        HashMap<Integer,Integer> map=new HashMap<>();
        for (int i=2;i*i<=x;i++){
            int cnt=0;
            boolean f=false;
            while (x%i==0){
                f=true;
                x/=i;
                cnt++;
            }
            if (f)map.put(i,cnt);
        }
        if (x>1)map.put(x,map.getOrDefault(x,0)+1);
        return map;
    }
}
class FastReader {
    BufferedReader br;
    StringTokenizer st;

    public FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }
}