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
def no3(a,b,c):
        return not any(filter(lambda x:x%3==0, [a,b,c]))

def solution(a,b,c,n):
        not_div = True
        add = 1
        while True:
                if no3(a,b,c):
                        break
                if c%3==0:
                        a,b = a+add, b+add
                        c -= (2*add)
                        if no3(a,b,c):
                                break
                if a%3==0:
                        a,b = a-(2*add), b-(2*add)
                        c += (4*add)
                        if no3(a,b,c):
                                break

        return a,b,c


n = int(input())
div = int(n/3)
rest = n%3
r = [div, div, div+rest]
r = solution(r[0], r[1], r[2], n)
print(f'{r[0]} {r[1]} {r[2]}')
