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 Codef {

    public static void main(String[] args) {
       
        Scanner input  = new Scanner(System.in);
        int a,b,c;
        int number=input.nextInt();
        int split=number/3;
        int resto=number%3;
        
        a=b=c=split;
        
        resto+=a+b;
        a=b=1;
        resto-=2;
        c+=resto;
        
        if(c%3==0){
            c--;
            a++;
        }
            
        System.out.println(a+ " "+ b+" "+c);
        
      }
    }

          
    
    

