Composite Factorization

Prime factorization expresses a natural number as a product of primes. Yeondu, who hates number theory with a passion, trembles at the mere sight of a prime, so instead she invented "composite factorization," which expresses a natural number as a product of composite numbers.

The composite factorization of a natural number $N$ is defined as a sequence $A$ that satisfies all of the following conditions.

• Every element of $A$ is a composite number. (A composite number is an integer that has a divisor other than $1$ and itself.)
• The product of all elements of $A$ is $N$.

However, Yeondu realized that $N$ may have several composite factorizations, or none at all. Write a program that performs composite factorization of $N$ on Yeondu's behalf. If several results are possible, choose the lexicographically smallest one.

The input is given as follows.

$N$

Among the composite factorizations of $N$, print the elements of the lexicographically smallest sequence in order, separated by spaces.

If no composite factorization is possible, print -1 instead.

• $2 \le N \le 10^{12}$
• $N$ is an integer.

The precise definition of a sequence $A = a_1, a_2, \dots, a_n$ being lexicographically smaller than a sequence $B = b_1, b_2, \dots, b_m$ is that one of the following holds.

• There exists an $i$ such that $a_1=b_1,\ a_2=b_2,\ \dots,\ a_{i-1}=b_{i-1}$ and $a_i < b_i$.
• $a_1=b_1,\ a_2=b_2,\ \dots,\ a_n=b_n$ and $n<m$.