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 yolo(n):
	denom = 0
	k = 0

	if n % 2 == 1:
		k = (n+1)/2
		denom = n*k

	if denom > 0:
		a,b,c = [int(x) for x in [k, denom+1, denom*(denom+1)]]
		
		if a==k and b == denom+1 and c == denom*(denom+1) and (a < 10**9 and b < 10**9 and c < 10**9)and (not duplicates([a,b,c])):
			print(str(a) + " " + str(b) + " " + str(c))
			return
	
	k = n
	denom = n
	a,b,c = [int(x) for x in [k, denom+1, denom*(denom+1)]]
	if a==k and b == denom+1 and c == denom*(denom+1) and (a < 10**9 and b < 10**9 and c < 10**9) and (not duplicates([a,b,c])):
		print(str(a) + " " + str(b) + " " + str(c))
		return

	print(-1)

def duplicates(arr):
	for i in range(len(arr)):
		for x in range(i+1, len(arr)):
			if arr[i] == arr[x]:
				return True
	return False


yolo(int(input()))