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.*;
import java.io.*;
public class Little
{
    public static void main(String[] args) throws IOException
    {
        BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
        long n=Integer.parseInt(in.readLine());
        long a,b,c;
        a=1;
        b=1;
        c=n-2;
        boolean c1=false;
        boolean c2=false;
        boolean c3=false;
        if(n==3)
            System.out.println(a+" "+b+" "+c);
        else
        {
            while(true)
        {
            if(a%3!=0&&b%3!=0&&c%3!=0)
                break;
            if(a%3==0)
            {
                a++;
                c--;
            }if(b%3==0)
            {
                b++;
                c--;
            }
            if(c%3==0)
            {
                if(a+1%3!=0)
                {
                    a++;
                    c--;
                }else if(b+1%3!=0)
                {
                    c--;
                    b++;
                }
            }
        }
            System.out.println(a+" "+b+" "+c);
        }
    }
}
