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
//1047a
import java.util.*;
import java.io.*;
public class lcl3{
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int a=1,b=1,c=1,f=0;
int n=sc.nextInt();
for(int i=1;i<=n-2;i++){
for(int j=1;j<=n-2;j++){
if(i+j<n){
a=i;b=j;c=n-i-j;
if(a%3!=0 && b%3!=0 && c%3!=0){
System.out.println(a+" "+b+" "+c);f=1;break;}
}
}
if(f==1) break;
}
}
}










