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;

/**
 *
 * @author izharishaksa
 */
public class C1047A {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] arr = new int[3];
        arr[0] = 1;
        arr[1] = 1;
        arr[2] = N - 2;
        if (arr[2] % 3 == 0) {
            arr[2]--;
            arr[1]++;
        }
        
        System.out.println(arr[0] + " " + arr[1] + " " + arr[2]);
    }

}