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

	public static void main(String[] args) {
		
		Scanner s = new Scanner(System.in);
		
		int n = s.nextInt();
		
		int a = 0,b = 0,c = 0;
	/*	if(n%3==0) {
			a = (n-3)/3 + 1;
			b = a;
			c = a;
		} else {
			a = n/3;
			b = n/3;
			c = n/3 + n%3;
		}
		*/
		
		int m=n;
		boolean yes = false;
		for(int i=1;i<n;i++) {
			if(i%3!=0) {
				a = i;
				for(int j=a;j<n;j++)
					if(j%3!=0) {
						b = j;
						c = m - b -a;
						if(c%3!=0 && c>0) {
							System.out.println(a+" "+b+" "+c);
							yes = true;
							break;	
						}
					}
				if(yes) 
					break;
			}
			
		}
		

	}
	
	
	

}
