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
from sys import stdin

def main():
	n = int(stdin.readline())
	ans = n//3
	if(ans*3 == n and ans%3 != 0):
		print(ans,ans,ans)
	elif(ans*3 == n and ans%3 == 0):
		print(ans-1,ans-1,ans+2)
	else:
		a,b = ans,n%3
		if(a%3 != 0 and (a+b)%3 != 0):
			print(a,a,a+b)
		elif(a%3 == 0 and (a+b)%3 != 0):
			print(a+1,a-1,a+b)
		elif(a%3 == 0 and (a+b)%3 == 0):
			print(a+2,a-1,a+b-1)
		elif(a%3 != 0 and (a+b)%3 == 0):
			if((a-1)%3 != 0):
				print(a-1,a,a+b+1)
			else:
				print(a+1,a,a+b-1)

main()
  			  		  	 		  	 				 	    		