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, a, b = list(map(lambda k: int(k), input().split(' ')))
# s = input()

def solveQ1(n, a, b, s):
	if s[a-1] == s[b-1]:
		return 0
	c = s[b-1]
	n = len(s)
	min_dist = n
	for i in range(n):
		if s[i] == c:
			min_dist = min(abs(a-1-i), min_dist)
	return min_dist

# n, k = list(map(lambda i: int(i), input().split(' ')))

def solveQ2(n, k):

	if n == 1:
		return 1
	if k == pow(2, n-1):
		return n
	if k > pow(2, n-1):
		return solveQ2(n - 1, k - pow(2, n-1))
	else:
		return solveQ2(n - 1, k)
# print(solveQ2(n, k))

# lst = [1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,6,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1]
n = int(input())
def solveQ3(n):
	if n == 1:
		print(-1)
		return
	else:
		print("{0} {1} {2}".format(n, n+1, n*(n+1)))
		return

solveQ3(n)
