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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class A_LiitleCLoves31 {

	public static void main(String[] args)	throws IOException{
		// TODO Auto-generated method stub
		
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		
		long t = Integer.parseInt(reader.readLine());
		long t1,t2,t3;
		
		
		t1=1;
		t2=1;
		t3=t-t1-t2;
		
		if(t3%3==0)
		{
			t3-=1;
			t1+=1;
		}
		
		
		System.out.println(t1+" "+t2+" "+t3);

	}

}
