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
#!/usr/bin/python

from __future__ import print_function
import sys

def isEven(n):
    return n%2 == 0

def divides(a, b):
    return b%a == 0

def C(n):
    if (isEven(n)):
        if (divides(3, n//2)):
            a = [n//2 - 1, n//2 - 1, 2]
        else:
            if (divides(3, n//2 - 1)):
                a = [n//2, n//2 - 2, 2]
            else:
                a = [n//2, n//2 - 1, 1]
    else:
        if (divides(3, (n-1)//2)):
            a = [(n+1)//2, (n-5)//2, 2]
        else:
            a = [(n-1)//2, (n-1)//2, 1]
    for x in a:
        print(x, end=' ')

def main():
    n = int(input())
    C(n)

if __name__ == '__main__':
    main()