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
x = int(input())
def find_multiple(x):
    for i in range(x):
        if not i % 3 or i == 0:
            continue
        for j in range(x-i-1, x):
            if not j % 3 or j == 0:
                continue
            for z in range(x-i-j, x):
                if not z % 3 or z == 0:
                    continue
                if i + j + z > x:
                    break
                if ((i + j + z) == x):
                    return '{} {} {}'.format(i, j, z)
print(find_multiple(x))