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
from sys import stdin
n = int(stdin.readline())
x1 = 2
x2 = 5
ans = 1
if n == 3:
    print(1, 1, 1)
    exit()
elif n == 4:
    print(1, 1, 2)
    exit()
elif n == 5:
    print(1, 2, 2)
    exit()
n -= 2
while True:
    if ans % 3 != 0 and n % 3 != 0:
        break
    if ans > n or n == 0:
        break
    ans += 1
    n -= 1
print(1, ans, n)
#print(12343%3)