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

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

If there is no such answer, print -1.

Input

The single line contains single integer n (1 ≤ n ≤ 104).

Output

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

If there are multiple answers, print any of them.

Examples

Input

3


Output

2 7 42


Input

7


Output

7 8 56
import math
def inp():
    return int(raw_input())
def linp():
    return map(int, raw_input().split())
n=inp()
a=n
b=(n+1)
c = (n*(n+1))
if a>=1 and a<=1000000000 and b>=1 and b<=1000000000 and c>=1 and c<=1000000000 and a!=b and b!=c and a!=c:
    print a, b, c
else:
    print -1