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
n = int(raw_input())
if n==1: print "-1"
elif n==2: print "2 3 6"
else:
    isAnswered = False
    x = (n+1)/2
    while x*2 < 3*n:
        c = x*2-n
        d = x*n
        y = x + 1
        while True:
            if (2*x*y-n*x-n*y) <= 0:
                y += 1
                break
            if (n*x*y) % (2*x*y-n*x-n*y) == 0:
                z = (n*x*y) / (2*x*y-n*x-n*y)
                print "%d %d %d" % (x,y,z)
                isAnswered = True
                break
            y += 1
        x += 1
        if isAnswered: break