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
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */


import java.util.Scanner;

/**
 *
 * @author Prakash
 */
public class JavaApplication1 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();
        int a,b,c;
        if(n%3==0){
            int x=n/3;
            if(x%3==0) {a=x-1;b=x-1;c=x+2;}
            else {a=x;b=x;c=x; }
        }
        else if(n%3==1){
            int x=n/3;
            if(x%3==0) {a=x+1;b=x+1;c=x-1;}
            else if(x%3==1){ a=x+1;b=x;c=x;}
            else {a=x;b=x-1;c=x+2; }
        }
        else{
            int x=n/3;
            if(x%3==0) {a=x+1;b=x+2;c=x-1;}
            else if(x%3==1){ a=x;b=x+1;c=x+1;}
            else {a=x;b=x;c=x+2; }
        }
        System.out.println(a+" "+b+" "+c);
    }
}
