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

	public static int[] getArray(int size) {
		int[] array = new int[size];
		for (int i = 0; i < size; i++) {
			array[i] = sr.nextInt();
		}
		return array;
	}

	public static int[][] getMatrix(int sizeI, int sizeJ) {
		int[][] array = new int[sizeI][sizeJ];
		for (int i = 0; i < sizeI; i++) {
			for (int j = 0; j < sizeJ; j++) {
				array[i][j] = sr.nextInt();
			}
		}
		return array;
	}

	public static boolean isSimpleNumber(int val) {
		for (int i = 2; i <= Math.sqrt(val); i++) {
			if (val % i == 0)
				return false;
		}
		return true;
	}

	public static int NOD(int a, int b) {
		while (a != 0 && b != 0) {
			if (a > b) {
				a = a % b;
			} else {
				b = b % a;
			}
		}
		return a + b;
	}

	public static int NOK(int a, int b) {
		return a * b / NOD(a, b);
	}

	public static long factorial(int i) {
		long res = 1;
		for (int j = 2; j <= i; j++) {
			res *= j;
		}
		return res;
	}

	static char letters[] = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
			'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z' };

	static Scanner sr = new Scanner(System.in);
	
	public static void main(String[] args) {
		
		int n = sr.nextInt();
		int a, b, c;
		int integerPart = n / 3;
		int fraction= n % 3;
		a = integerPart; 
		b = integerPart; 
		c = integerPart;
		if (fraction == 2) {
			a++;
			b++;
		} else if (fraction == 1) {
			a++;
		}
		
		int sa = a % 3;
		int sb = b % 3;
		int sc = c % 3;
		int counter = 1;
		while (!isOK(sa, sb, sc)) {
			counter = ((int)(Math.random() * 10000)) % 4;
			//System.out.println(counter);
			if (counter == 1) {
				a++;
				b--;
			}
			
			if (counter == 2) {
				b++;
				c--;
			}
			
			if (counter == 3) {
				c++;
				b--;
			}
			sa = a % 3;
			sb = b % 3;
			sc = c % 3;
		}
		
		System.out.println(a + " " + b + " " + c);
	}
	public static boolean isOK(int sa, int sb, int sc) {
		return sa != 0 && sb != 0 && sc != 0;
	}
}