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 main():
    n = int(input())

    a = b = n // 3
    c = n - (a + b)
    while a % 3 == 0 or b % 3 == 0 or c % 3 == 0:
        if a % 3 == 0:
            if (b + 1) % 3 == 0:
                a += 1
                b -= 1
            else:
                a -= 1
                b += 1

        if b % 3 == 0:
            if (c + 1) % 3 == 0:
                b += 1
                c -= 1
            else:
                b -= 1
                c += 1

        if c % 3 == 0:
            if (a + 1) % 3 == 0:
                c += 1
                a -= 1
            else:
                c -= 1
                a += 1

    print(a)
    print(b)
    print(c)


if __name__ == '__main__':
    main()