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
#Division a Number d into three part a,b and c
#a % 3 > 0; b % 3 > 0; c % 3 > 0
#3<= d <= 10e9
def division(n):
    #NumList = checkModBy3(n)
    for a in range(1, n):
        for b in range(1, n):#NumList:
            for cp in range(1, n):#NumList:
                c = n-cp
                #print(a,b,c)
                if a+b+c == n:
                    if (a%3>0) and (b%3>0) and (c%3>0):
                        return "{} {} {}".format(a, b, c)
                elif a+b+c < n:
                    break    

n = input()
print(division(int(n)))
