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.*;
import java.util.Formatter;
public class Main {
	
	public static int gcd(int a,int b)
	{
		int r;
		
		while(b>0)
		{
			r=a%b;
			a=b;
			b=r;
		}
		
		return a;
	}
	
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		
		int i,j,b,c,k,n,d,m,sum=0,l;

		
		n=sc.nextInt();
		
		for(i=1;i<=2;i++) for(j=1;j<=2;j++) if(n-i-j>0 && (n-i-j)%3!=0) 
			{System.out.println(i+" "+j+" "+(n-j-i));
			System.exit(0);
			}
		
		
		
	} 

}


