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 calc(n, a):
    for i in range(-2, 3):
        for j in range(-2, 3):
            for k in range(-2, 3):
                if (a[0] + i)%3 != 0 and (a[1] + j)%3 != 0 and (a[2] + k)%3 != 0 and ((a[0] + i) > 0) and ((a[1] + j) > 0) and ((a[2] + k) > 0) and (sum(a) + i + j + k) == n:
                    print(a[0] + i, a[1] + j, a[2] + k)
                    return

n = int(input())
a = [n//3,n//3,n - 2*(n//3)]
calc(n, a)