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 Main {
	public static void main(String[]args) {
		Scanner in = new Scanner(System.in);
		int c = in.nextInt();
		int n = c/3;
		if(c%3==0) {
			
			if(n%3==0) {
				System.out.println((n-1) + " " + (n-1) + " " + (n+2));
			}else {
				System.out.println(n + " " + n + " " + n);
			}
			
		}else if(c%3 == 1) {
			
			if(n%3==0) {
				System.out.println((n-2) + " " + (n+1) + " " + (n+2));
			}else if(n%3==1){
				System.out.println(n + " " + n + " " + (n+1));
			}else {
				System.out.println((n-1) + " " + n + " " + (n+2));
			}
			
		}else {
			
			if(n%3==0) {
				System.out.println((n-1) + " " + (n+1) + " " + (n+2));
			}else if(n%3==1){
				System.out.println(n + " " + (n+1) + " " + (n+1));
			}else {
				System.out.println(n + " " + n + " " + (n+2));
			}
			
		}
	}
}
			 		  			 				 						   	 			