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 = int(input())
# sw = 1
# for x in range(1, 1000):
#     if not sw: break
#     for y in range(x+1, 1000):
#         for z in range(y+1, 1000):
#             if 2 / n == (1/x + 1/y + 1/z):
#                 res = str(x) + ' ' +str(y) + ' ' + str(z)
#                 sw = 0
# if sw:
#     print(-1)
# else:
#     print(res)
# 
# 7 
# 7 8  56
    
#   2      1     1     1
#  ---  = --- + --- + ---
#   n      n     n+1  (n+1)*n

#   2      1     1     1
#  ---  = --- + --- + ---
#   7      7     7+1  (7+1)*7


# 3
#  2 7 42

#   2      1     1     1
#  ---  = --- + --- + ---
#   3      3     3+1  (3+1)*3

#   2      1     1     1       4 + 3 + 1       8
#  ---  = --- + --- + ---  = ------------- = -----
#   3      3     4     12          12          12

n = int(input())

if n != 1:
    print(n, n+1, (n+1)*n)
else:
    print(-1)
  			 		 				   	 	    			  	