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
a=int(input())
x=int(a/3)
b=c=d=e=x
if(b+b+b==a):
	if(b%3==0):
		c=c-2
		d=d+1
		e=e+1
elif (b+b+b!=a):
	f=a-3*b
	if(b%3==0):
		c=c-2
		d=d+1
		e=e+1
		if(f==1):
			c=c+1
		elif (f==2):
			d=d+1
			e=e+1
	elif (b%3!=0):
		if((b-1)%3==0):
			if(f==2):
				c=c+1
				d=d+1
			elif(f==1):
				c=c+1
		elif((b-1)==1):
			if(f==1):
				c=c+2
				d=d-1
			else:
				c=c+3
				d=d-1

		else:
			if(f==2):
				c=c+2
			elif(f==1):
				c=c-1
				d=d+2
print(c,d,e)
