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


def primeFactors(n):
    prime = []
    while n % 2 == 0:
        prime.append(2)
        n = n // 2
    i = 3
    while i <= math.sqrt(n):
        while n % i == 0:
            prime.append(i)
            n = n//i
        i += 2
    if n > 2:
        prime.append(n)
    return prime


te = int(input())
while te > 0:
    te -= 1
    n = int(input())
    factors = primeFactors(n)
    # print(factors)
    if len(factors) < 3:
        print('NO')
    else:
        if len(factors) == 3:
            x, y, z = factors
        else:
            x = factors[0]
            j = 3
            if factors[0] != factors[1]:
                y = factors[1]
                j = 2
            else:
                y = factors[1]*factors[2]
            z = 1
            while j < len(factors):
                z = z*factors[j]
                j += 1
        if x == y or y == z or x == z:
            print('NO')
        else:
            print('YES')
            print(x, y, z)
