Product of Three Numbers

## 题目描述 给定一个数 $n$ ，请求出三个不相同的整数 $a,b,c$ 且 $2 \leq a,b,c$ ，使得 $a \cdot b \cdot c =n$。 如果有多个答案，输出任一合法解。 本题有多组数据。 ## 输入格式 第一行有一个数 $t$ $(1\leq t \leq 100)$ ，代表数据组数。 接下来 $t$ 行，每行一个数 $n$ $(2 \leq n \leq 10^9)$ ，为题中所给的 $n$ 。 ## 输出格式 如果不存在合法的 $a,b,c$ ，输出 `NO` 。 否则，输出 `YES` 。

You are given one integer number $ n $ . Find three distinct integers $ a, b, c $ such that $ 2 \le a, b, c $ and $ a \cdot b \cdot 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.

The first line of the input contains one integer $ t $ ( $ 1 \le t \le 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 \le n \le 10^9 $ ).

For each test case, print the answer on it. Print "NO" if it is impossible to represent $ n $ as $ a \cdot b \cdot c $ for some distinct integers $ a, b, c $ such that $ 2 \le a, b, c $ . Otherwise, print "YES" and any possible such representation.

5
64
32
97
2
12345

YES
2 4 8 
NO
NO
NO
YES
3 5 823