Prime Factorization

Given a positive integer \(n\), represent it as \(n = p_1 \times p_2 \times \dots \times p_k\), where each \(p_i\) is a prime number and \(p_1 \leq p_2 \leq \dots \leq p_k\). It can be proven that the sequence \(p_i\) is unique. Your task is to compute and output the prime factors \(p_1, p_2, \dots, p_k\) of the given number.

inputFormat

The input consists of a single positive integer \(n\) (e.g. 2 ≤ \(n\) ≤ 10^9) representing the number to be factorized.

outputFormat

Output the prime factors of \(n\) in non-decreasing order, separated by single spaces.

sample

2

2