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
a = int(input())
if a % 3 == 0:
    if a % 9 == 0:
        print(int(a/3) - 2,int(a/3) + 1,int(a/3) + 1)
    else:
        print(int(a/3),int(a/3),int(a/3))
if a % 3 == 1:
    if((a//3) % 3 == 0):
        print(a//3 - 1,a//3 + 1,(a//3) + 1)
    elif (((a//3)+1) % 3 == 0):
        print(a//3,a//3 - 1,(a//3) + 2)
    else: 
        print(a//3,a//3,(a//3) + 1)
if a % 3 == 2:
    if((a//3) % 3 == 0):
        print(a//3 - 1,(a//3)+2,(a//3)+1)
    elif (((a//3)+1) % 3 == 0):
        print(a//3,a//3,(a//3) + 2)
    else:
        print(a//3,(a//3) + 1,(a//3) + 1)
