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.lang.*;
import java.io.*;
import java.util.*;

public class Solution
{
    public static ArrayList al;
    public static int tgl;
    
    public static void F(int N, int k)
    {
        if(tgl==1)
            return;
            
        if(k==2)
        {
            if(N%3!=0)
            {
                al.add(N);
                tgl = 1;
            }
            return;
        }
        
        for(int i=1; i<N; i++)
        {
            if(i%3!=0)
            {
                al.add(i);
                F(N-i,k+1);
                
                if(tgl==1)
                    break;
                    
                al.remove(al.size()-1);
            }
        }
    }
    
    
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        tgl = 0;
        al = new ArrayList();
        
        F(N,0);
        
        for(int i=0; i<al.size(); i++)  
            System.out.print(al.get(i)+" ");
    }
}