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(input())
v=[]
v.append(int(n/3))
v.append(int(n/3))
v.append(n - 2 * int(n/3))
for i in range(3):
        if v[i]%3==0:
            prox = (i+1)%3
            if v[prox]%3 == 0:
                v[i] = v[i] + 1
                v[prox] = v[prox] - 1
            else:
                if (v[prox]+1)%3 == 0:
                    v[i] = v[i] + 1
                    v[prox] = v[prox] - 1
                else:
                    v[i] = v[i] - 1
                    v[prox] = v[prox] + 1
print(v[0],v[1],v[2])