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
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  while (~scanf("%d", &n)) {
    int mid = n / 3, yu = n % 3;
    if (yu == 0) {
      if (mid % 3 == 0)
        printf("%d %d %d\n", mid - 1, mid - 1, mid + 2);
      else
        printf("%d %d %d\n", mid, mid, mid);
    } else if (yu == 1) {
      if (mid % 3 == 0)
        printf("%d %d %d\n", mid - 1, mid + 1, mid + 1);
      else if (mid % 3 == 1)
        printf("%d %d %d\n", mid, mid, mid + 1);
      else if (mid % 3 == 2)
        printf("%d %d %d\n", mid - 1, mid, mid + 2);
    } else if (yu == 2) {
      if (mid % 3 == 0)
        printf("%d %d %d\n", mid - 1, mid + 1, mid + 2);
      else if (mid % 3 == 1)
        printf("%d %d %d\n", mid, mid + 1, mid + 1);
      else if (mid % 3 == 2)
        printf("%d %d %d\n", mid, mid, mid + 2);
    }
  }
  return 0;
}
