- You are required to display the prime factorization of a number.
- Take as input a number n.
- Print all its prime factors from smallest to largest.
Example 1:
Input: 1440 Output: 2 2 2 2 2 3 3 5
Example 2:
Input: 46 Output: 2 23
Constraints:
2 <= n < 10 ^ 9