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

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        Value value = new Value(sc.nextInt());
        sc.nextLine();

        if (value.getN() % 3 == 0)
            value.substractTwo();
        else
            value.substractThree();

    }

}

class Value {
    private static PrintStream out = new PrintStream(System.out);
    private int n;

    public Value(int n) {
        this.n = n;
    }

    public int getN() {
        return n;
    }

    public void setN(int n) {
        this.n = n;
    }

    public void substractTwo() {
        this.n -= 2;
        out.println("1 1 " + this.n);
    }


    public void substractThree() {
        this.n -= 3;
        out.println("1 2 " + this.n);
    }
}
