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
n = int(input())
a = b = n//3
c = n - 2*b
nums = [a, b, c]
res = list(map(lambda x: x % 3, nums))
resnums = zip(res, nums)
resnums = sorted(resnums, key = lambda x: x[0])
a, b, c = tuple(map(lambda x: x[1], resnums))
isres = list(map(lambda x: x[0] > 0, resnums))

if sum(isres) > 2:
    print(a, " ", b, " ", c)
    sys.exit()

if sum(isres) > 1:
    if resnums[2][0] == 2:
        a = a - 2
        c = c + 2
    else:
        a = a - 1
        c = c + 1
    print(a, " ", b, " ", c)
    sys.exit()

if sum(isres) > 0:
    a = a - 1
    b = b + 1
    print(a, " ", b, " ", c)
    sys.exit()

if sum(isres) == 0:
    a = a - 2
    b = b +1
    c = c +1
    print(a, " ", b, " ", c)
    sys.exit()



