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 math
t=int(input())
for tt in range(t):
    n=int(input())
    m=n
    fact=[]
    while m%2==0:
        fact.append(2) 
        m = m / 2
    for i in range(3,int(math.sqrt(m))+1,2): 
        while m % i== 0: 
            fact.append(i) 
            m = m / i 
    if m > 2: 
        fact.append(m)
    a,b = 1,1
    for v in fact:
        if a == 1:
            a = v
        elif b == 1 or b == a:
            b *= v
        else:
            break
    if (a*b) == 0:
        print('NO')
        continue
    c = n/(a*b)
    if c == 1 or c == a or c == b:
        print('NO')
        continue
    print('YES')
    d = int(c)
    print(a,b,d)
