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: positive integers
# a + b + c = n, positive integer
# 3 !| a, b, c


def abc(n):
    a = b = c = n // 3
    
    remainder = n - 3 * (n // 3)

    if a % 3 == 0:
        a -= 1
        b -= 1
        c += 2
        
    while remainder:
        if (a + 1) % 3 != 0:
            a += 1
            remainder -= 1
        elif (b + 1) % 3 != 0:
            b += 1
            remainder -= 1
        elif (c + 1) % 3 != 0:
            c += 1
            remainder -= 1
        else:
            c += 2
            a -= 1
            remainder -= 1
            
    return a, b, c

if __name__ == '__main__':
    
    n = int(input().rstrip())

    a, b, c = abc(n)

    print(a, b, c)
