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 
from sys import stdin, stdout
from math import sqrt


def solve():
    n = int(input())
    st = set()
    for i in range(2, int(sqrt(n)) + 1):
        if n%i == 0 and i not in st:
            st.add(i)
            n /= i
            break
    for i in range(2, int(sqrt(n)) + 1):
        if n%i == 0 and i not in st:
            st.add(i)
            n /= i
            break
    if n == 1 or n in st or len(st) < 2:
        print("NO")
        return 0
    else:
        print("YES")
        A = []
        for i in st: A.append(int(i))
        A.append(int(n))
        print(A[0], A[1], A[2])
    return 0

t = int(input())
for i in range(t):
    solve()