Prime Factorization

Given an integer \( n \), compute its prime factorization. If \( n < 2 \), the output should be empty. Otherwise, output the list of prime factors in non-decreasing order, separated by a single space.

For example, for \( n = 28 \), the prime factors are 2 2 7 because \( 28 = 2 \times 2 \times 7 \). For a prime number (e.g. \( n = 19 \)), the output is simply 19 and for \( n = 1 \) or any \( n < 2 \), you should output nothing.

Input: A single integer \( n \) is given from standard input.

Output: Print the prime factors of \( n \) separated by a single space to the standard output. If there are no factors (i.e. when \( n < 2 \)), print an empty line.

inputFormat

The input consists of a single integer \( n \) read from standard input.

outputFormat

Output the prime factors of \( n \) as a sequence of integers separated by a space. If \( n < 2 \), output an empty line.

28

2 2 7