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())
r=n%3
n1,n2,n3=0,0,0
y=0
if(r!=0):

    n1=n//3
    if(n1%3==0):
        n1=n1-1
    rem=n-n1
    n2=rem//2
    n3=rem-n2
    while(y!=1):
        if(n2%3==0) or (n3%3==0):
            n2=n2-1
            n3=n3+1
        else:
            y=1
            
    

   
else:

    r2=n//3

    if(r2%3==0):

        n1=n2=r2-1
        n3=r2+2
    else:

        n1,n2,n3=r2,r2,r2

print(n1,n2,n3)
    

