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.*;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map.Entry;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class GTFO{

    static int N;
    static PrintWriter out;
    static int[] ans;

    public static void main(String[] args)throws Exception{
        Scanner sc = new Scanner(System.in);
        out = new PrintWriter(System.out);
      	int n=sc.nextInt();
      	int ans=0;
      	int n1=0;
      	int n2=0;
      	int n3=0;
      	ans=n/3;  	
  
      	if(n%3!=0) {
      		if(ans%3==0) {
      			n1=(n/3)-2;
      			n2=(n/3)-2;
      			n3=(n)-(n1+n2);
      			if(n3%3==0) {
      				n1++;
      				n3--;
      			}
      		}
      		else	if((ans+1)%3==0) {
      			n1=(n/3)-1;
      			n2=(n/3)-1;
      			n3=(n)-(n1+n2);
      			if(n3%3==0) {
      				n1++;
      				n3--;
      			}
      		}
      		else {
      			n1=(n/3);
      			n2=(n/3);
      			n3=(n)-(n1+n2);
      			if(n3%3==0) {
      				n1++;
      				n3--;
      			}
      		}
      	}
      	
      	else {
      		
      		if(ans%3==0) {
      			n1=ans+1;
      			n2=ans+1;
      			n3=ans-2;
      		}
      		else {
      			n1=n2=n3=ans;
      		}
      		
      	}
      	System.out.println(n1+" "+n2+" "+n3);
      	
      	
      	
        
        
        out.flush();
      	
        

    }

    static class Scanner{
        StringTokenizer st;
        BufferedReader br;
        public Scanner(InputStream system) {br = new BufferedReader(new InputStreamReader(system));}
        public Scanner(String file) throws Exception {br = new BufferedReader(new FileReader(file));}
        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }
        public String nextLine()throws IOException{return br.readLine();}
        public int nextInt() throws IOException {return Integer.parseInt(next());}
        public double nextDouble() throws IOException {return Double.parseDouble(next());}
        public char nextChar()throws IOException{return next().charAt(0);}
        public Long nextLong()throws IOException{return Long.parseLong(next());}
        public boolean ready() throws IOException{return br.ready();}
        public void waitForInput() throws InterruptedException {Thread.sleep(3000);}
    }
}