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
y = int(input())
if y >= 6:
    a = y//3
    b = y//3
    c = y//3 + y%3
    if a%3 != 0 and b%3 != 0 and c%3 != 0 and a > 0 and b > 0 and c > 0:
        print(a,b,c)
    else:
        a = a - 1
        if a%3 == 0:
          a = a + 2
          c = c - 1
          print(a,b,c)
        else:
            b = b - 1
            c = c + 2
            if a%3 != 0 and b%3 != 0 and c%3 != 0 and a > 0 and b > 0 and c > 0:
                 print(a,b,c)
            else:
                a = a + 2
                c = c - 2
                print(a,b,c)
else:
    a = y//3
    b = y//3
    c = y//3 + y%3
    if a%3 != 0 and b%3 != 0 and c%3 != 0 and a > 0 and b > 0 and c > 0:
        print(a,b,c)
    else:
        c = c - 1
        b = b + 1
        print(a,b,c)










    

