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
x = int(input())
t = (x%3)
k = 0
if x>= 3 and x<=9:
	if x == 4:
		print(1,1,2)
	if x == 3:
		print(1,1,1)
	if x == 6:
		print(2,2,2)
	if x == 5:
		print(2,2,1)
	if x == 7:
		print(1,2,4)
	if x == 8:
		print(4,2,2)
	if x == 9:
		print(5,2,2)
if x > 9:
	# print(x)
	if t == 2:
		k = (x//3)

		if k%3 == 0:
			print(k+4,k-1,k-1)
		if k%3 == 1:
			print(k+1,k+1,k)
		if k%3 == 2:
			print(k,k-1,k+3)
	elif t == 1:
		k = int(x//3)
		if k%3 == 0:
			print(k-2,k+1,k+2)
		elif k%3 == 1:
			print(k,k,k+1)
		elif k%3 == 2:
			print(k+2,k-1,k)

	elif t == 0:
		k = x//3
		if k%3 == 0:
			print(k-2,k+1,k+1)
		if k%3 == 1:
			print(k+1,k+1,k-2)
		if k%3 == 2:
			print(k,k,k)