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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep=" ")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]


g = II()

for j in range(g):
    n = II()
    fl = 0

    i = 2
    used = set()
    while i*i*i<n:
        if n % i == 0:
            used.add(i)
            n //= i
            break
        i += 1

    if len(used) == 0:
        print("NO")
        continue

    i += 1
    while i * i < n:
        if n % i == 0:
            used.add(i)
            n //= i
            break
        i += 1

    if len(used) == 1:
        print("NO")
        continue

    if n not in used:
        used.add(n)
        print("YES")
        p2D(used)
    else:
        print("NO")































