In this problem you are asked to represent a positive integer number n as a multiplication of as many different positive integer factors as possible. \InputFile The first line of the input le contains a single positive integer number \textbf{n} (\textbf{1} ≤ \textbf{n} ≤ \textbf{1000000000}). \OutputFile In the first line on the output file, print the maximum possible number of different factors in the representation of \textbf{n}. In the second line, print \textbf{k} factors in any order separated by spaces. If there are multiple possible factorizations, output any of them.