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
import java.util.*;
public class Three
{
    public static void main(String args[])
    throws Exception
    {
        Scanner scan=new Scanner(System.in);
        int n=scan.nextInt();
        int x=1,y=2,z=0;
        for(int i=0;i<n;i++)
        {
            if(n>=4)
            {
            x=x;
            y=y;
            z=n-(x+y);
        }
        else
        {
            x=n/3;
            y=n/3;
            z=n/3;
        }
            if(x%3!=0 && y%3!=0 && z%3!=0)
            {
                System.out.print(x+" "+y+" "+z);
                break;
            }
            else
            { x=x+1;
                y=y;
                z=n-(x+y);
                System.out.print(x+" "+y+" "+z);
                break;
                }
        }
    }
}