Hide
Problem G
Big Factoring
Languages
en
is
You are given a positive integer $n$ and should print the prime factors of $n$.
Input
The first and only line of input contains a positive integer $2 \leq n \leq 10^{24}$.
Output
Print the prime factors of $n$ in ascending order. If a prime factor occurs multiple times in $n$ then you should print it that number of times in the output.
| Sample Input 1 | Sample Output 1 |
|---|---|
166448 |
2 2 2 2 101 103 |
