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 
import sys
input=sys.stdin.readline
t=int(input())
p=[]
for _ in range(t):
    n=int(input())
    
    fac=[]
    for i in range(2,int(n**0.5)+1):
        if(n%i==0):
            fac.append(i)
            fac.append(n//i)
    
    nn=len(fac)
    st=0
   # print(fac)
    for i in range(nn):
        for j in range(i+1,nn):
            if(n%(fac[i]*fac[j])==0):
                k=n//(fac[i]*fac[j])
                if fac[i]==fac[j] or fac[i]==k or fac[j]==k:
                    continue
                if 1 in [fac[i],fac[j],k]:
                    continue
                st=1
                ii,jj,kk=fac[i],fac[j],k
                break
            
    if st:
        print("YES")
        print(ii,jj,kk)
    else:
        print("NO")
