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 jdk.nashorn.internal.objects.NativeArray;

import javax.swing.JOptionPane ;
import javax.swing.plaf.basic.BasicInternalFrameTitlePane;
import java.sql.SQLSyntaxErrorException;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
import java.util.Vector;

import static jdk.nashorn.internal.objects.NativeArray.sort;
import static jdk.nashorn.internal.runtime.ScriptObject.toPropertyDescriptor;

public class Dialog1 {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n ;
        n = input.nextInt();
        if((n - 2) % 3 != 0) {
            System.out.print(1);System.out.print(' ');System.out.print(1);System.out.print(' ');System.out.print(n - 2);
        } else {
            System.out.print(1);System.out.print(' ' );System.out.print(2);System.out.print(' ');System.out.print(n - 3);
        }
    }
}