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
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;


public class Code
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int a,b,c,d,e;
		a=b=c=n/3;
		//System.out.println(a+" "+b+" "+c);
		if((a+b+c)!=n)
		{
		    c=c+(n-(a+b+c));
		}
		if(a==b && a==c)
		{
		  if(a%3==0)
		  {
		      a=a-2;
		      b++;c++;
		  }
		}
		else{
		    if(a%3==0)
		    {
		        a++;
		        b--;
		    }
			if(c%3==0)
			{
				c--;
				b++;
				if(b%3==0)
				{
					c+=3;
					b=b-2;
					a--;
				}
			}
		   
		}
		System.out.println(a+" "+b+" "+c);
	}
}
