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
range = xrange
input = raw_input
 
t = int(input())
for _ in range(t):
    n = int(input())
    fac = []
    i = 2
    while i * i <= n:
        while n % i == 0:
            fac.append(i)
            n //= i
        i += 1
    if n > 1:
        fac.append(n)
    
    fac.reverse()
 
    a = fac.pop()
    b = 1
    while b <= a and fac:
        b *= fac.pop()
    c = 1
    while (c <= a or c == b) and fac:
        c *= fac.pop()
    
    if a > 1 and b > 1 and c > 1 and a != b and a != c and b != c:
        a,b,c = sorted((a,b,c))
        for f in fac:
            c *= f
        print 'YES'
        print a,b,c
    else:
        print 'NO'
    
