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

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a = 0;
		int b = 0;
		int c = 0;
		if (n % 9 == 0) {
			int bayus = n / 3;
			a = bayus - 2;
			b = bayus + 1;
			c = bayus + 1;
		}
		else if (n % 3 == 0) {
			a = n / 3;
			b = n / 3;
			c = n / 3;
		}
		else if (n % 9 == 1) {
			int bayus = n / 3;
			a = bayus - 1;
			b = bayus + 1;
			c = bayus + 1;
		}
		else if (n % 9 == 2) {
			int bayus = n / 3;
			a = bayus - 1;
			b = bayus + 1;
			c = bayus + 2;
		}
		else if (n % 9 == 4) {
			int bayus = n / 3;
			a = bayus;
			b = bayus;
			c = bayus + 1;
		}
		else if (n % 9 == 5) {
			int bayus = n / 3;
			a = bayus;
			b = bayus + 1;
			c = bayus + 1;
			
		}
		else if (n % 9 == 7) {
			int bayus = n / 3;
			a = bayus - 1;
			b = bayus;
			c = bayus + 2;
		}
		else if (n % 9 == 8) {
			int bayus = n / 3;
			a = bayus;
			b = bayus;
			c = bayus + 2;
		}
		System.out.println(a + " " + b + " " + c);
	}

}
