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
n = int(input())
vs = [n // 3 for i in [0,1,2]]
vs[2] = n - vs[1] - vs[2]
d = [0] * 3
for d[0] in range(-3, 4):
    for d[1] in range(-3, 4):
        for d[2] in range(-3, 4):
            if sum(d) + sum(vs) == n and all((vs[i] + d[i]) % 3 != 0 and vs[i] + d[i] >= 1 for i in [0,1,2]):
                print(*[vs[i] + d[i] for i in [0,1,2]])
                exit(0)
