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.Scanner;
public class Main1
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int e=n/3;
        int a=e;
        int b=e;
        int c=e;
        int dif;
        if(a%3==0)
        {
            a=b=c=e+1;
            dif=(3*a)-n;
            if(dif==1)
            {
                b=b-2;
                c=c+1;
            }
            else if(dif==2)
            {
                b=b-3;
                c=c+1;
            }
            else if(dif==3)
            {
                c=c-3;
            }
        }
        else
        {
            dif=n-(3*a);
            if(dif==1)
            {
                c=c+1;
                if(c%3==0)
                {
                    b=b+2;
                    c=c-2;
                }
            }
            if(dif==2)
            {
                c=c+2;
                if(c%3==0)
                {
                    b=b+1;
                    c=c-1;
                }
            }
        }
        System.out.println(a+" "+b+" "+c);
    }
}