It is required to decompose the integer N into prime factors, presenting it as a product of prime factors and display the result in ascending order.
Input
The input number N (\(2 <= N <= 10^9\)).
Output
Print a list of prime factors of N in non-decreasing order, separated by «*».
Examples
| # |
Input |
Output |
| 1 |
5 |
5 |
| 2 |
30 |
2*3*5 |