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 example {

    public static void main (String[] argc) {
        Scanner next = new Scanner(System.in);
        int n = next.nextInt();
        en(n);
    }
    static void en(int n){
    int a = n / 3, b = n / 3, c = n / 3, last = n % 3;
    if (a % 3 == 0){
        switch (last){
            case 0:
                a = a - 2;
                b++;
                c++;
                break;
            case 1:
                a = a - 1;
                b++;
                c++;
                break;
            case 2:
                a--;
                b = b + 2;
                c++;
                break;
        }
    } else if (a % 3 == 1){
                switch (last){
            case 1:
                a++;
                break;
            case 2:
                a++;
                b++;
                break;
        }
    } else {
        switch (last){
            case 1:
                a = a + 2;
                b--;
                break;
            case 2:
                a++;
                a++;
                break;
        }
    }
    System.out.printf("%s %s %s",a,b,c);
}

}