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.

Input

The first line contains a single positive integer number n (1 ≤ n ≤ 109).

Output

In the first line print the maximum possible number k of different factors in the representation of n. In the second line print k factors in increasing order.