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 q_4 {
    static Scanner sc;

    public static void main(String[] args){
        sc = new Scanner(System.in);
        int n = getInt();
        int c = n%3;
        if(c==0){
            System.out.print(1+" "+1+" "+(n-2) );
        }
        else if(c==1){
            System.out.println(1+" "+2+" "+(n-3));
        }
        else {
            System.out.print(2+" "+2+" "+(n-4));
        }
    }





    public static int getInt(){
        return sc.nextInt();
    }

    public static String getString(){
        return sc.next();
    }

    public static String nextLine(){
        return sc.nextLine();
    }

    public static long nextLong(){
        return sc.nextLong();
    }

}

