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 math import ceil
from math import floor	
	
def mod_expo(n, p, m):
	"""find (n^p)%m"""
	result = 1
	while p != 0:
		if p%2 == 1:
			result = (result * n)%m
		p //= 2
		n = (n * n)%m
	return result
	
def find_least_diff(n):
	A = 2*(pow(2, n/2-1) - 1) 
	B = -pow(2, n/2)
	return int(abs(B - A))
	
def print_xyx(n):
	if n == 1:
		print(-1)
	else:
		print(n, n+1, n*(n+1))

t=1
# t=int(input())
while t:
	t = t - 1
	count=0
	# n, ox, oy = map(int, input().split())
	px = []
	py = []
	#u, v = map(int, input().split())
	n = int(input())
	# l = list(map(int, input().strip().split()))[:n]
	print_xyx(n)


	
