Canonical Decomposition
Medium
Execution time limit is 1 second
Runtime memory usage limit is 64 megabytes
Given a natural number in decimal form, up to 200 digits long, where all prime divisors are less than or equal to 500,000, write a program to output its canonical prime factorization in ascending order.
Input
The input consists of a single line containing a natural number with up to 200 digits.
Output
The output should be a single line displaying the canonical prime factorization of the given number, formatted according to the specified rules (refer to the example).
Examples
Input #1
Answer #1
Input #2
Answer #2
Input #3
Answer #3
Submissions 191
Acceptance rate 19%