J. Interesting numbers
time limit per test
2 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output

Professor Sh. has recently become interested in number theory. In particular, he was very interested in the decomposition of a number into prime factors. Recall that a natural number is called a prime number if it has exactly two distinct natural divisors: 1 and the number itself. Professor Sh. calls a number N interesting if it can be presented as a product of exactly six pairwise distinct primes. Unfortunately, the professor does not know how to check too large numbers for interest.

Help Professor Sh. – write a program that based on a given number N will find if it is interesting.

Input

A single line contains an integer N (2 ≤ N ≤ 1018).

Output

In a single line print " - 1" if the number is not interesting, or 6 prime numbers in ascending order – the divisors of the number N.

Examples
Input
2
Output
-1
Input
3
Output
-1
Input
6
Output
-1