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
//package placement;
import java.io.*;
import java.util.*;
public class adj {
		
	


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

