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 
for t in range(int(input())):
    n=int(input())
    
    p,q=0,0
    """
    for i in range(2,int(n)):
        if c==1:
            break
        elif n%i==0:
            for j in range(2,int(pow(n,1/2))+1):
                if j==i:
                    continue 
                if c==1:
                    break
                if n%(i*j)==0:
                    r=n/(i*j)
                    if r==1:
                        continue
                    if i!=j and r!=j and i!=r: 
                        if i*j*r==n:
                            #print (i," ",j," ",int(n/(i*j)))
                            p=i
                            q=j
                            r=int(n/(i*j))
                            c=1
                            break
    """
    for i in range(2,int(pow(n,1/2)+1)):
        if n%i==0:
            p=i
            n=n/i
            break
    for i in range(2,int(pow(n,1/2)+1)):
        if n%i==0 and p!=i:
            q=i
            n=n/i
            break
    #print(p,q,n)
    n=int(n)
    if p!=0 and q!=0 and n!=1 and n!=p and n!=q:
        print("YES")
        print (p,q,int(n))
        #print (p," ",q," ",r)
    else:
        print("NO")
        