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
value = int(input())
if(value == 0):
    print("0 0 0")
elif(value == 1):
    print("0 0 1")
elif(value == 2):
    print("0 0 2")
elif(value == 3):
    print("1 1 1")
elif(value == 5):
    print("1 2 2")
else:
    div = int(value/3)
    arr = [div, div, div]
    if(arr[0] + arr[1] + arr[2] != value):
        arr[0] = value - arr[1] - arr[2]
    while(arr[0]%3 == 0 or arr[1]%3== 0):
        arr[0] += 2
        arr[1] -= 1
        arr[2] -= 1
    print(str(int(arr[0])) + " " + str(int(arr[1])) + " " + str(int(arr[2])))

 	      	  	  	   		 	  	   			