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.*;

public class A {

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

	}
}
