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
# import sys
# sys.stdin=open("input.in",'r')
# sys.stdout=open("output4.out",'w')
n=int(input())
c=0
while n%3!=0:
	n-=1
	c+=1
x=n//3	
if x%3==0 :
	if (x+c)%3==0:
		print(x+2,x-1,x+c-1)
	else:
		print(x+1,x-1,x+c)	
elif (x+c)%3==0:
	if (x-1)%3==0:
		print(x,x+1,x+c-1)
	else:
		print(x,x-1,x+c+1)
else:
	print(x,x,x+c)			
