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
#https://codeforces.com/contest/1047/problem/A

if __name__ == "__main__":
    n = int(input())
    orig = n
    a = n // 3
    if a % 3 == 0:
        a -= 1
    n -= a

    b = max(n // 3, 1)
    if b % 3 == 0:
        b -= 1
    n -= b

    c = n
    if c % 3 == 0:
        if (a + 1) % 3 != 0:
            a += 1
            c -= 1
        elif (b + 1) % 3 != 0:
            b += 1
            c -= 1
        elif (a + 2) % 3 != 0:
            a += 2
            c -= 2
        else:
            b += 2
            c -= 2
    
    assert a + b + c == orig
    assert a % 3 != 0 and b % 3 != 0 and c % 3 != 0
    
    print('{} {} {}'.format(a, b, c))
        
