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
def solve(n):
    if n == 1:
        return None
    return (n, n + 1, n * (n + 1))

def test(n, x, y, z):
    import math
    assert x != y
    assert y != z
    assert x <= 10**9
    assert y <= 10**9
    assert z <= 10**9
    assert math.isclose(2/n, 1/x + 1/y + 1/z, abs_tol=1e-10)

def testAll():
    for i in range(1, 10000 + 1):
        r = solve(i)
        if i == 1:
            assert r is None
        else:
            test(i, *r)

if __name__ == '__main__':
    n = int(input())
    r = solve(n)
    if r is None:
        print(-1)
    else:
        print('{} {} {}'.format(*r))

    #testAll()
