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(raw_input())

a, b, c = n/3 + (n % 3), n/3, n/3

def is_div(x):
    return x % 3 == 0

while True:
    if is_div(a):
        a -= 1
        b += 1
    if is_div(b):
        b -= 1
        c += 1
    if is_div(c):
        c -= 1

        if c == a:
            c -= 1
            a += 2
        else:
            a += 1

    if not any([is_div(a), is_div(b), is_div(c)]):
        break

print "{} {} {}".format(a, b, c)
