PROGRAMMING:Prime factorization
Given a positive integer $$n $, find its prime factorization result, that is, give its factorization expression $$n = {P}_ 1}^{k_ 1} \cdot {p_ 2}^{k_ 2} \cdots {p_ m}^{k_ m}$$。
###Input format:
Enter a positive integer n in the range of long int.
###Output format:
Output the prime factorization expression of n according to the given format, namely 'n = P1 ^ K1 * P2 ^ K2 *... * PM ^ km', where 'Pi' is the prime factor and output from small to large, and the index 'ki' is the number of 'Pi'; When 'ki' is 1, that is, when there is only one factor 'Pi', no 'ki' is output.
###Input example:
```in
one thousand three hundred and twenty-three
```
###Output example:
```out
1323=3^3*7^2
```
answer：If there is no answer, please comment
###Input format:
Enter a positive integer n in the range of long int.
###Output format:
Output the prime factorization expression of n according to the given format, namely 'n = P1 ^ K1 * P2 ^ K2 *... * PM ^ km', where 'Pi' is the prime factor and output from small to large, and the index 'ki' is the number of 'Pi'; When 'ki' is 1, that is, when there is only one factor 'Pi', no 'ki' is output.
###Input example:
```in
one thousand three hundred and twenty-three
```
###Output example:
```out
1323=3^3*7^2
```
answer：If there is no answer, please comment