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 
# -*- coding: utf-8 -*-
"""
Created on Tue Feb  4 23:28:21 2020

@author: User
"""


import math
n = int(input())
num = []
for i in range(n):
    num.append(int(input()))
    
for x in num:
     flag = 0
     counter = 0
     y = int(math.sqrt(x))
    
     for j in range(2,y+1) :
        if flag == 1 : break
        elif x % j == 0 :
                a = int(j)
                nu = int(x/j)
                z=int(math.sqrt(nu))
            
                for k in range(j+1,z+1) :
                    if nu % k == 0 :
                        b = int(k)
                        c = int(nu/k)
                        if b==c or a==c : 
                            counter = 0
                        else :
                            print('YES')
                            print(a,b,c)
                            flag = 1
                            counter = 1
                            break
     if counter == 0 :
        print('NO')


    


    
    
    
    
    
   