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
import sys

x = int(input())
y = x / 2 - 1
z = x / 2 - 2
u = x / 3
i = x - 1
m = i / 2
a = x - 2
j = x - 2
b = x - 3
if x == 3:
    print(1, 1, 1)
    sys.exit()
elif j % 3 != 0:
    print(j, 1, 1)
    sys.exit()
elif b % 3 != 0:
    print(b , 1, 2)
elif x == 5:
    print(1, 2, 2)
    sys.exit()
elif x == 7:
    print(4, 1, 2)
    sys.exit()
elif x == 8:
    print(2, 2, 4)
    sys.exit()