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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

/**
 * @author 4kara
 */
public class A {

    void solve() {
        int n = nextInt();
        for (int i = 1; i < n; i++) {
            if ((n - i - 1) % 3 != 0) {
                System.out.println("1 " + i + " " + (n - i - 1));
                return;
            }
        }
    }

    void init() {
        br = new BufferedReader(new InputStreamReader(System.in));
        solve();
        try {
            br.close();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }

    BufferedReader br;
    StringTokenizer st;

    String next() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return st.nextToken();
    }

    Integer nextInt() {
        return Integer.parseInt(next());
    }

    Long nextLong() {
        return Long.parseLong(next());
    }

    Double nextDouble() {
        return Double.parseDouble(next());
    }

    public static void main(String[] args) {
        new A().init();
    }
}