Prime Factors

You are given an integer \( n \) and are required to compute all its prime factors in ascending order. If \( n < 2 \), there are no prime factors, and you should output an empty line.

Your solution should efficiently handle both small and large values of \( n \). The output should list the prime factors separated by a single space.

inputFormat

A single integer \( n \) is provided via standard input.

outputFormat

Output the prime factors of \( n \) in ascending order separated by a single space. If \( n \) is less than 2 or has no prime factors, output an empty line.

13

13