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 
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
# import numpy as np
t = int(input())
ans = []
for _ in range(t):
    n = int(input())
    l = prime_factorize(n)
    L = l[0]
    R = l[-1]
    if L == R and len(l) > 3:
        R *= l[-2]
        l.pop(-1)
    if len(l) >=3 and L != R:
        # prod = np.prod(l[1:-1])
        prod = 0
        for i in range(len(l[1:-1])):
            prod = prod*(l[1+i]) if prod != 0 else l[1]
        if prod != L and prod != R:
            ans.append('YES')
            ans.append(str(L) + ' ' + str(prod) + ' ' + str(R))
        else:
            ans.append('NO')
    else:
        ans.append('NO')
for i in range(len(ans)):
    print(ans[i])