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.util.*;
import java.io.*;
public class little_c_love3
{  
  
  Scanner sc=new Scanner(System.in);
  PrintWriter pr=new PrintWriter(System.out,true);
  public static void main(String... args) 
  {
       little_c_love3 c=new little_c_love3();
       c.prop();
  }
  public void prop() 
  {
    int n,x ;
     n=sc.nextInt();
     
       if(n%3==0)
       {
         x=n/3 ;
           if(x%3==0)
              pr.println((x-1)+" "+(x-1)+" "+(x+2));
            else
              pr.println(x+" "+x+" "+x);             
       }else
       {
        x=n/3 ;
        
          if(x%3==0)
            pr.println((x-1)+" "+(x+1)+" "+(x+n%3));
          else
           {
            if((x+n%3)%3==0)
            {
               if((x+1)%3==0)
                pr.println(x+" "+(x+2)+" "+(x+n%3-2));
               else
                 pr.println((x)+" "+(x+1)+" "+(x+n%3-1));
            }else
            {
              pr.println((x)+" "+(x)+" "+(x+n%3));
            }
           }      
       }
      
  }
 
}
