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
'''
@author: neprostomaria
'''

if __name__ == '__main__':
    num = int(input())
    
    a, b = 1, 1
    c = num - a - b
    while a%3 == 0 or b%3 == 0 or c%3 == 0:
        if a == b and a%3 != 2:
            b, c = b + 1, c - 1
        elif a != b and a%3 != 2:
            a, c = a + 1, c - 1
        elif a == b and a%3 == 2:
            a, b, c = a + 2, b + 2, c - 4
    
    print(str(a) + " " + str(b) + " " + str(c))