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
class CodeforcesTask1047ASolution:
    def __init__(self):
        self.result = ''
        self.n = 0

    def read_input(self):
        self.n = int(input())

    def process_task(self):
        if not self.n % 3:
            a = 1
            b = 1
            c = self.n - 2
        else:
            a = 1
            b = 2
            c = self.n - 3
        self.result = f"{a} {b} {c}"

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask1047ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
