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())
if n % 3 == 0 and (n // 3) % 3 != 0:
    print((n // 3), (n // 3), (n // 3))
    exit()
a = []
c = 0
a.append(n // 3)
a.append(n // 3)
a.append(n - (a[0] + a[1]))
for i in range(3):
    if a[i] % 3 == 0:
        a[i] -= 1
        c += 1
i = 0
while c != 0:
    if (a[i] + c) % 3 != 0:
        a[i] += c
        c = 0
        break
    else:
        a[i] += (c - 2)
        c = 2
        i += 1
        if i == 2:
            i = 0
print(a[0], a[1], a[2])
