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 mi():
	return map(int, input().split())

n = int(input())
ans = [0]*3
if n%2:
	ans[2] = 1
	ans[0] = n//2
	ans[1] = n//2
	if ans[0]%3==0:
		ans[0]-=1
		ans[1]+=1
else:
	ans[2] = 2
	ans[1] = 2
	ans[0] = n-ans[2]-ans[1]
	if ans[0]<=0:
		ans[1] = ans[0] = 1
	if ans[0]%3==0:
		ans[0]+=1
		ans[1]-=1
print (*ans)
'''
233
77 77 79

3
1 1 1
'''
