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 sc = new Scanner(System.in);
		int n = sc.nextInt();
		if(n == 3) {
			System.out.println(1+" "+1+" "+1);
		}
		else {
			
			int a = n/3;
			int b = n%3;
			switch(b) {
			case 0:
				
				if(a%3 == 0) {
					System.out.print((a-1)+" "+(a-1)+" "+(a+2));
				}
				else {
					System.out.println((a)+" "+a+" "+a);
				}
				break;
			case 1:
				
				if(a%3 == 0) {
					System.out.println((a-2)+" "+(a+1)+" "+(a+2));
				}
				else if((a+1)%3 == 0){
					System.out.println((a)+" "+(a-1)+" "+(a+2));
				}
				else {
					System.out.println((a)+" "+(a)+" "+(a+1));
				}
				break;
			default:
				
				if(a%3 == 0) {
					System.out.println((a-1)+" "+(a+1)+" "+(a+2));
				}
				else if((a+2)%3 == 0){
					System.out.println((a)+" "+(a+1)+" "+(a+1));
				}
				else {
					System.out.println((a)+" "+(a)+" "+(a+2));
				}
				break;
			}
		}
		
		
		
	}
}
	  	 		      	 	 	 				   	  	