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 
num = int(input())
answer = []
for i in range(num):
    target = int(input())
    lis = []
    k = 2
    while len(lis)<2 and k**2<target:
        if target % k == 0:
            target = target //k
            lis.append(k)
        k += 1

    if len(lis) == 2 and target not in lis:
        answer.append([lis[0],lis[1],target])
    else:
        answer.append('NO')

for i in answer:
    if i == "NO":
        print(i)
    else:
        print('YES')
        print(i[0],i[1],i[2])

  			    		 						   		 	 		 		