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
//package codeforces.r511_1047;

import java.util.Scanner;

public class A {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();

        int divide = n / 3;
        int remainder = n % 3;

        int a = 0, b = 0, c = 0;

        if (divide % 3 == 0) {
            a = divide - 2;
            b = divide + 1;
            c = divide + 1;
            if (remainder == 1) {
                a += 1;
            } else if (remainder == 2) {
                a += 1;
                b += 1;
            }
        } else if (divide % 3 == 1) {
            a = divide;
            b = divide;
            c = divide;
            if (remainder == 1) {
                a += 1;
            } else if (remainder == 2) {
                a += 1;
                b += 1;
            }
        } else { // divider %3  = 2
            a = divide;
            b = divide;
            c = divide;
            if (remainder == 1) {
                a -= 1;
                b += 2;
            } else if (remainder == 2) {
                a -= 1;
                b += 3;
            }
        }
//            if (a + b + c == n) {
//                System.out.println(n+" = " + (a % 3) + " " + (b % 3) + " " + (c % 3));
//            } else {
//                System.out.println("not possible " + n);
//            }
        System.out.println(a + " " + b + " " + c);

    }
}
