Introduction - If you have any usage issues, please Google them yourself
The experimental task
As you know s_sin is a fun not the P small children (if you hate he can jump directly to the
Second), you know he is like a strategy game called a Solar Empire. I assure you that this is too recent
Yang Empire series eighth chapter.
Sin_s through the game to learn a number theory: any natural number more than 1, can be uniquely decomposed into a finite
The product of prime numbers, here are all prime numbers, the index is a positive integer
The number of. For example:
Sin_s now wants to obtain the theorem of P1, P2,..., Pn and A1, A2, an, such as 1200... You need to get 2^4*3*5^2.
Data input
The first line is a positive integer N (1< N =2^31).
Data output
The output line represents the number of N (the only prime decomposition in ascending order of prime numbers).