Vladik and Chloe decided to determine who of them is better at math. Vladik claimed that for any positive integer n he can represent fraction $\text{[math]}$ as a sum of three distinct positive fractions in form $\text{[math]}$ .

Help Vladik with that, i.e for a given n find three distinct positive integers x, y and z such that $\text{[math]}$ . Because Chloe can't check Vladik's answer if the numbers are large, he asks you to print numbers not exceeding 10⁹.

If there is no such answer, print -1.

Input

The single line contains single integer n (1 ≤ n ≤ 10⁴).

Output

If the answer exists, print 3 distinct numbers x, y and z (1 ≤ x, y, z ≤ 10⁹, x ≠ y, x ≠ z, y ≠ z). Otherwise print -1.

If there are multiple answers, print any of them.

Vladik and fractions

Examples