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 
from math import sqrt

def fatores(n):
    fat = {}
    for p in range(2, int(sqrt(n)+1)):
        while n % p == 0:
            n/=p
            if not fat.get(p):
                fat[p] = 0
            fat[p]+=1
        p+=1

    if n > 1:
        fat[int(n)] = 1
    return fat
    
for _ in range(int(input())):
    n = int(input())
    f = [list(i) for i in fatores(n).items()]
    
    q = 0
    ans = [1,1,1]
    
    for i in range(len(f)):
        p,m = f[i]
        cont = 1
        
        while cont <= f[i][1]:
            f[i][1] -= cont
            ans[q] *= (f[i][0]**cont)
            
            cont += 1
            q+=1
            
            if q == 3:
                break
            
        if q == 3:
            break
            
#    print(q)
#    print(f)
    
    for i in f:
        ans[2] *= i[0]**i[1]
    if ans[0] != ans[1] and ans[0] != ans[2] and ans[1] != ans[2] and min(ans) >= 2:    
        print('YES')
        print(*ans)
    else:
        print('NO')
