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.math.BigInteger;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.Stream;

public class Solution {

	public static void main(String[] args) {
		
		Scanner scanner = new Scanner(System.in);
		
		BigInteger number = new BigInteger(scanner.nextLine());
		
		BigInteger[] result = new BigInteger[3];
		
		result[0] = BigInteger.ONE;
		number = number.subtract(BigInteger.ONE);
		
		if(number.subtract(BigInteger.ONE).mod(BigInteger.valueOf(3)).compareTo(BigInteger.ZERO) == 0) {
			result[1] = BigInteger.valueOf(2);
		} else {
			result[1] = BigInteger.valueOf(1);
		}
		
		result[2] = number.subtract(result[1]);
		
		System.out.println(Stream.of(result).map(BigInteger::toString).collect(Collectors.joining(" ")));
	}
	
	
}
