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

primes = [True]*10001
primes[0] = primes[1] = False
for i in range(2,int(10000**0.5)+1):
    if primes[i]:
        for x in range(i*2,10001,i):
            primes[x] = False
            
def facto(n):
    i = 1
    arr = [0]*(n+1)
    while i <= int(n**0.5):
        i += 1
        if n % i == 0:
            while n % i == 0:
                n //= i
                arr[i] += 1
    if n > 1:
        arr[n] += 1
    return arr
                
n = int(input())
if primes[n] or n == 1:
    if (n + 1)*n != n+1:
        print(n,(n + 1)*n,n+1)
    else:
        print(-1)
else:
    arr = facto(n)
    first2 = 1
    cnt = 0
    for x in range(2,n+1):
        while cnt < 2 and arr[x]:
            arr[x] -= 1
            cnt += 1
            first2 *= x
        if cnt == 2:
            break
    
    print(n,n*(first2+1),(n//first2)*(first2+1))