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:
    a = b = c = n / 3
    if a % 3 == 0:
        a -= 2
        b = c = c + 1
elif (n + 1) % 3 == 0:
    a = b = c = (n+1)/3
    a -= 1
    if a % 3 == 0:
        a -= 1
        b += 1
    elif b % 3 == 0:
        b -= 1
        c += 1
else:
    a = b = c = (n+2)/3
    a -= 2
    if a % 3 == 0:
        a += 1
        b -= 1
    elif b % 3 == 0:
        b -= 1
        c += 1

print(str(int(a)) + " " + str(int(b)) + " " + str(int(c)))