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(n):
    a, r = n // 3, n % 3
    if a % 3 == 0:
        if r == 0:
            return [a+1, a+1, a-2]
        elif r == 1:
            return [a+4, a-1, a-2]
        elif r == 2:
            return [a+2, a+2, a-2]
    else:
        if r == 0:
            return [a, a, a]
        elif r == 1:
            if (a + 1) % 3 == 0:
                return [a+2, a-1, a]
            else:
                return [a+1, a, a]
        elif r == 2:
            if (a + 2) % 3 == 0:
                return [a+1, a+1, a]
            else:
                return [a+2, a, a]

print(" ".join([str(i) for i in f(int(input()))]))
