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
from collections import defaultdict
from fractions import gcd
from bisect import *
import sys
sys.setrecursionlimit(5*10**6)
def sint():
    return int(raw_input())
def sarr():
    return [int(x) for x in raw_input().split()]
def sstr():
    return raw_input()
"""
t=1
for ii in range(t):
    n=sint()
    a1=2
    b1=n
    m=n
    ans=[]
    while m<=10**2:
        a2=1
        b2=m
        x=a1*(b2/b1)-a2
        i=1
        while i*i<m:
            if m%i==0:
                aa=i
                bb=m/i
                if aa+bb==x:
                    ans=[aa,bb,b2]
                    break
            i+=1
        if ans!=[]:
            print ans[0],ans[1],ans[2]
        m+=n
    if ans==[]:
        print ii,-1
    else:
        ans.sort()
        print ii,ans[0],ans[1],ans[2]
"""
n=sint()
if n==1:
    print -1
else:
    print n,n+1,n*(n+1)
