Codeforces Round #686 (Div. 3) D. Number into Sequence 唯一分解定理

You are given an integer n (n>1).

Your task is to find a sequence of integers a1,a2,…,ak such that:

each ai is strictly greater than 1;
a1⋅a2⋅…⋅ak=n (i. e. the product of this sequence is n);
ai+1 is divisible by ai for each i from 1 to k−1;
k is the maximum possible (i. e. the length of this sequence is the maximum possible).
If there are several such sequences, any of them is acceptable. It can be proven that at least one valid sequence always exists for any integer n>1.

You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤5000) — the number of test cases. Then t test cases follow.

The only line of the test case contains one integer n (2≤n≤1010).

It is guaranteed that the sum of n does not exceed 1010 (∑n≤1010).

Output
For each test case, print the answer: in the first line, print one positive integer k — the maximum possible length of a. In the second line, print k integers a1,a2,…,ak — the sequence of length k satisfying the conditions from the problem statement.

If there are several answers, you can print any. It can be proven that at least one valid sequence always exists for any integer n>1.

Example
inputCopy
4
2
360
4999999937
4998207083
outputCopy
1
2
3
2 2 90
1
4999999937
1
4998207083
将一个数分解成最小因数乘积并记录每个因子个数，最后输出最长的n-1个因子和剩余部分
ps:现在感觉每场四题就尽力了，DIv3还要被手速碾压，还是老老实实Div2去吧QAQ

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<map>
#include<stack>
#include<set>
#include<queue>
#include<vector>
#