Prime Factorization

Given a positive integer \( n \) (with \( n \ge 2 \)), your task is to compute its prime factorization.

If \( n \) can be expressed as \( n = p_1^{a_1} \times p_2^{a_2} \times \cdots \times p_k^{a_k} \), then you should output the list of prime factors in ascending order, repeating each prime according to its exponent. For example, if \( n = 28 \), then the prime factorization is \( 28 = 2 \times 2 \times 7 \), so the output should be 2 2 7.

inputFormat

The input is read from standard input (stdin) and contains a single integer \( n \) in one line \( (n \ge 2) \).

outputFormat

The output should be written to standard output (stdout) as a sequence of prime factors in ascending order, separated by a single space.

10

2 5