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.*;
import java.io.*;

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