Little C loves number «3» very much. He loves all things about it.

Now he has a positive integer n. He wants to split n into 3 positive integers a,b,c, such that a+b+c=n and none of the 3 integers is a multiple of 3. Help him to find a solution.

Input

A single line containing one integer n (3 ≤ n ≤ 10^9) — the integer Little C has.

Output

Print 3 positive integers a,b,c in a single line, such that a+b+c=n and none of them is a multiple of 3.

It can be proved that there is at least one solution. If there are multiple solutions, print any of them.

Examples

Input

3


Output

1 1 1

Input

233

Output

77 77 79
def myfunc_2(n):
	x = n // 2
	if x % 3 == 0:
		if (n - (x + 1)) >= 0 and (n - (x + 1)) % 3 != 0:
			return x + 1, n - (x + 1)
		elif (n - (x - 1)) >= 0 and (n - (x - 1)) % 3 != 0:
			return x - 1, n - (x - 1)
	else:
		#print('hi')
		if ((x + 2) % 3) != 0 and n - (x + 2) >= 0 and (n - (x + 2 )) % 3 != 0:
			#print('1')
			return x + 2 , n - (x + 2)
		elif ((x + 1) % 3 != 0) and  (n - (x + 1)) >= 0 and (n - (x + 1)) % 3 != 0:
			#print('2')
			return x + 1, n - (x + 1)
		elif (x % 3) != 0 and  (n - (x )) >= 0 and (n - (x )) % 3 != 0:
			#print('3')
			return x , n - (x )
def myfunc_3(n):
	x = n // 3
	if x % 3 == 0:
		first = x - 1
	else:
		first = x

	second, third = myfunc_2(n - first)
	print(first, second, third)

n = int(input())
myfunc_3(n)
