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
n=int(input())
if (n==5):
    a=1
    b=2
    c=2
elif (n%3==0):
    a=n//3
    if (a%3==0):
        b=a+2
        c=a-1
        a=a-1
    else:
        b=a
        c=a
        a=a
else:
    a=n//3
    ost=n%3
    if (a%3==0):
        b=a+ost
        c=a+1
        a=a-1
    else:
        if ((a+ost)%3==0):
            b=a-ost
            c=a+2*ost
            a=a
        else: #(a-ost)%3==0
            b=a+ost
            c=a
            a=a
print(a, b, c)
            
        
