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())
z = 0
if(n==1):
    print -1
else:
    for x in xrange(2,1000000001):
        for y in xrange(x+1,1000000001):
            if((1/float(x)+1/float(y))>=2/float(n)):
                break
            z = float(n*x*y)/float(2*x*y-n*y-n*x)
            if z==float(int(z)) and z!=x and z!=y:
                print x, y, int(z)
                break
            else:
                if(z<y):
                    z = 0
                    break
                z = 0
        if(z>0):
            break