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.*;
import java.util.*;

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		//for(long n = 3;n<=(long)1e9;n++) {
		StringTokenizer st = new StringTokenizer(br.readLine());
		long n = Long.parseLong(st.nextToken());
		long a=0,b=0,c=0;
		if(n%3==0) {
			a = n/3;
			b = n/3;
			c = n/3;
			if(a%3==0) {
				a--;
				b--;
				c+=2;
			}
		}
		else if(n%3==1) {
			a = n/3;
			b = n/3;
			c = n/3+1;
			if(a%3==0) {
				a++;
				b--;
			}
			if(c%3==0) {
				a--;
				b--;
				c+=2;
			}
		}
		else {
			a = n/3;
			b = n/3;
			c = n/3+2;
			if(a%3==0) {
				a++;
				b--;
			}
			if(c%3==0) {
				a++;
				b++;
				c-=2;
			}
		}
		System.out.println(a+" "+b+" "+c);
		//System.out.println(((a+b+c==n) && (a>0 && b>0 && c>0)));
		/*if(!((a+b+c==n) && (a>0 && b>0 && c>0))) {
			System.out.println(n);
		}*/
		//}
		br.close();
	}
}