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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class LittleLoves3
{

    public static void main(String[] args)throws IOException
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int n=Integer.parseInt(br.readLine());
        int a,b,c;
        if(n%3==0)
        {
            if((n/3)%3==0)
            {
                a=n/3-1;
                b=n/3-1;
                c=n/3+2;
                System.out.println(a+" "+b+" "+c);
            }
            else
                System.out.println(n/3+" "+n/3+" "+n/3);
        }
        else if(n%3==1) {
            if ((n/3)%3==0) {
                a = n/3+1;
                b = n/3-1;
                c = a;
                System.out.println(a+" "+b+" "+c);
            } else if ((n / 3) % 3 == 1) {
                System.out.println((n/3) + " " + ((n/3)) + " " + ((n/3)+1));
            } else {
                a = n/3+2;
                b = n/3-1;
                c = n/3;
                System.out.println(a+" "+b+" "+c);
            }
        }
        else
        {
            if((n/3)%3==0)
                System.out.println(((n/3)+2)+" "+((n/3)-1)+" "+((n/3)+1));
            else if((n/3)%3==1)
                System.out.println(((n/3)+1)+" "+((n/3)+1)+" "+((n/3)));
            else
                System.out.println(((n/3)+2)+" "+n/3+" "+n/3);
        }
    }
}