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
# cook your dish here

inpVal = int(input())

divVal = inpVal//3
modVal = inpVal%3
divModVal = divVal%3


if divModVal == 0:
    
    if (inpVal - 2*(divVal+1))%3 != 0:
        print(str(divVal + 1) + " " + str(divVal + 1)+ " "+ str(inpVal - 2*(divVal+1)))
    else:
        print(str(divVal + 2) + " " + str(divVal + 2)+ " "+ str(inpVal - 2*(divVal+2)))

    
elif divModVal == 1:
    
    if (inpVal - 2*(divVal))%3 != 0:

        print(str(divVal) + " " + str(divVal)+ " "+ str(inpVal - 2*(divVal)))
    else:
        
        print(str(divVal+1) + " " + str(divVal+1)+ " "+ str(inpVal - 2*(divVal+1)))
else:
    
    if (inpVal - 2*(divVal))%3 != 0:
        print(str(divVal) + " " + str(divVal)+ " "+ str(inpVal - 2*(divVal)))
    else:
        print(str(divVal-1) + " " + str(divVal-1)+ " "+ str(inpVal - 2*(divVal-1)))