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 CF1047A {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] remainder = {
                {1,1,1},            // 3
                {1,1,2},            // 4
                {1,2,2},            // 5
                {2,2,2},            // 6
                {1,2,4},            // 7
                {2,2,4},            // 8
                {2,2,5},            // 9
                {2,4,4},            // 10
                {2,4,5},            // 11
            };

        int q = (n - 3) / 9;
        int r = ((n - 3) % 9);

        System.out.print(3 * q + remainder[r][0] + " ");
        System.out.print(3 * q + remainder[r][1] + " ");
        System.out.print(3 * q + remainder[r][2] + " ");

    }
}
