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
def Solution():
    n = int(raw_input())
    
    if n%3 == 0:
        a = n/3
        if a%3 == 0:
            print a+1,a+1,a-2
        else:
            print a,a,a
    elif n%3 == 1:
       a = n/3
       if a%3 == 0:
           print a+1,a+1,a-1
       else:
           b = a+1
           while a%3 == 0 or b%3 == 0 and b > 0:
               a += 1
               b -= 2
           if b <= 0:
                b += 2
                print b,b,5
           else:
                print a,a,b
    else:
        a = n/3
        if a%3 == 0:
            print a+2,a+2,a-2
        else:
            b = a+2
            while a%3 == 0 or b%3 == 0:
                a += 1
                b -= 2
            print a,a,b

Solution()