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.lang.*;
import java.io.*;
public class Solution
 {

	static long d,x,y;
	
	static long extendedEuclid(long A, long B) {
	    if(B == 0) {
	        d = A;
	        x = 1;
	        y = 0;
	    }
	    else {
	        extendedEuclid(B, A%B);
	        long temp = x;
	        x = y;
	        y = temp - (A/B)*y;
	    }
	    return d;
	}
	public static void main (String[] args)
	 {
	 Scanner s= new Scanner(System.in);
	 long n=s.nextLong();
	 if((n-2)%3==0)
	 {
		 System.out.println("1 2 "+(n-3));
	 }
	 else
		 System.out.println("1 1 "+(n-2));
	 
	 
	 
	 }
}