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

public class A1047 {
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        long a=sc.nextLong();
        long d=a/3;

        long k=1;
        long l=1;
        long u=a-2;
        while (true) {
            if (k % 3 != 0 && l % 3 != 0 && u % 3!=0) {
                break;

            }else {
                k=k+1;
                l=l+1;
                u=u-2;

            }
        }
        System.out.println(k+" "+l+" "+u);
    }
}

