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
# http://codeforces.com/contest/1047/problem/A

from itertools import combinations
n=int(input())

# lis=list(range(1,n))+list(range(1,n))+list(range(1,n))
# for x,y,z in list(combinations(lis,3)):
# 	if(x+y+z==n and x%3!=0 and y%3!=0 and z%3!=0):
# 		print(x," ",y," ",z)
# 		break
if n<=10:
	lis=list(range(1,n))+list(range(1,n))+list(range(1,n))
else:
	lis=list(range(n-5,n))+[1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,10,10,10]
# print(lis)
for x,y,z in list(combinations(lis,3)):
	if(x+y+z==n and x%3!=0 and y%3!=0 and z%3!=0):
		print(x," ",y," ",z)
		break