Background

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 as a sum of three distinct positive fractions in form .

Description

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

Format

Input

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

输入一个正整数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.

输出正整数x,y,z。

使x,y,z满足: 2/n = 1/x + 1/y + 1/z。

(1 ≤ x, y, z ≤ 10⁹, x ≠ y, x ≠ z, y ≠ z)。

若无解，请输出-1。

Samples

3

2 7 42

Limitation

1s, 1024KiB for each test case.