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
def f(m):
    for i in range(1,n+1):
        for j in range(1,n-i):
            if i%3!=0 and j%3!=0 and (n-i-j)%3!=0:
                return i, j, n-i-j
n=eval(input())
nums=f(n)
print('{} {} {}'.format(nums[0], nums[1], nums[2]),end='')
			 			   		  	 	 	  					  	 	