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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
		
		
		public class Scanner {
			BufferedReader br;
			StringTokenizer st;
			Scanner()
			{
				br = new BufferedReader(new InputStreamReader(System.in));
			}
			String next() throws IOException
			{
				while(st==null || !st.hasMoreTokens())
				{
					st = new StringTokenizer(br.readLine());
				}
				return st.nextToken();
			}
			int nextInt() throws IOException
			{
				return Integer.parseInt(next());
			}
			long nextLong() throws IOException
			{
				return Long.parseLong(next());
			}
			
			
			public static void main(String[] args) throws IOException {
				Scanner sc = new Scanner();
				int n = sc.nextInt();
				if(n%3==0)
					System.out.println(1+" "+1+" "+(n-2));
				else
				{
					if((n+1)%3==0)System.out.println(1+" "+2+" "+(n-3));
					else System.out.println(1+" "+1+" "+(n-2));
				}
					
			}
			
		
			
				
			}
			
			
			
			
				
			
			
			
			
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
		
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			