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())
tmp = n//3
if ((n%3)==0): 
	if ((tmp%3)):
		print(tmp, end=' ')
		print(tmp, end=' ')
		print(tmp, end=' ') 
	else:
		print(tmp-2, end=' ')
		print(tmp+1, end=' ')
		print(tmp+1, end=' ')
else:
	if n%3 == 2:
		if (tmp+1)%3  == 0:
			print(tmp, end=' ')
			print(tmp, end=' ')
			print(tmp+2, end=' ')
		elif (tmp+2)%3 == 0:
			print(tmp, end=' ')
			print(tmp+1, end=' ')
			print(tmp+1, end=' ')
		else:
			print(tmp-1, end=' ')
			print(tmp+1, end=' ')
			print(tmp+2, end=' ')
	elif n%3 == 1:
		if (tmp+1)%3 == 0:
			print(tmp-1, end=' ')
			print(tmp, end=' ')
			print(tmp+2, end=' ')
		elif (tmp%3) == 0:
			print(tmp-1, end=' ')
			print(tmp+1, end=' ')
			print(tmp+1, end=' ')
		else:
			print(tmp, end=' ')
			print(tmp, end=' ')
			print(tmp+1, end=' ')

