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 Fenjie(n):
    k = {}
    if (n == 1):
        return {}
    a = 2
    while (n >= 2):
        b = n%a
        if (a*a > n):
            if (n in k):
                k[n] += 1
            else:
                k[n] = 1
            break
        if (b == 0):
            if (a in k):
                k[a] += 1
            else:
                k[a] = 1
            n = n//a
        else:
            a += 1
    return k

n = int(input())
for _ in range(n):
    m = int(input())
    k = Fenjie(m)
    s = 0
    le = len(k)
    l = [i for i in k]
    if (le >= 3):
        print("YES")
        flag = 0
        print(l[0], l[1], m//l[0]//l[1])
    elif (le==2):
        if (k[l[0]]+k[l[1]] >= 4):
            print("YES")
            print(l[0], l[1], m//l[0]//l[1])
        else:
            print("NO")
    else:
        if (k[l[0]] >= 6):
            print("YES")
            print(l[0], l[0]*l[0], m//l[0]//l[0]//l[0])
        else:
            print("NO")