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
n = int(input())
a = [n//3] * 3
md = n % 3
mr = [int(i) % 3 for i in a]
k = 0
if mr == [0,0,0] and md == 1:
	a[0] += 1
	a[1] += 1
	a[2] -= 1
elif mr == [0,0,0] and md == 2:
	a[0] += 2
	a[1] += 1
	a[2] -= 1
elif mr == [0,0,0] and md == 0:
	a[0] += 1
	a[1] += 1
	a[2] -= 2
else:
	for i in range(md):
		if mr[k] == 2:
			a[k] += 2
			a[k+1] -= 1
			mr[k] = mr[k+1] = 1
			k += 1
		elif mr[k] == 0:
			a[k] += 1
			mr[k] = 1
		elif mr[k] == 1:
			a[k] += 1
			mr[k] = 2
			k += 1

print("%d %d %d"%(a[0],a[1],a[2]))
# print(mr)
# print(md)
# print(a)