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 


t = int(input())
while t!=0:

    n = int(input())
    p = int(pow(n,.5))
    a,b,c = -1,-1,-1
    for i in range(2,p+1):
        if n%i==0:
            a= i
            n = n//i
            break
    q = int(pow(n,.5))
    for i in range(2,q+1):
        if i!=a and n%i==0 and i!=n//i:
            b=i
            c=n//i
            break
    if a!=-1 and b!=-1 and c!=-1:
        print("YES")
        print(a,b,c)
    else:
        print("NO")






    t-=1


