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 loves3():
    n = int(input())
    for i in range(n//2+1):
        if i % 3 == 0 : continue
        for j in range(n, n//2-1, -1):
            if j % 3 == 0 : continue
            if (n-j-i) % 3 != 0 and (n-j-i)>0:
                print(str(i)+' '+str(j)+' '+str(n-i-j))
                return

loves3()
