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

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