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;
const int N = 100000 + 20;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int n;
int main() {
  while (scanf("%d", &n) != EOF) {
    int a = n / 3, b = a, c = n - a * 2;
    if (a % 3 == 0) {
      a -= 2;
      b += 2;
    }
    if (b % 3 == 0) {
      b -= 2;
      c += 2;
    }
    if (c % 3 == 0) {
      if (b % 3 == 0 || b % 3 == 1) {
        b += 1;
        c -= 1;
      } else if (b % 3 == 2) {
        b -= 1;
        c += 1;
      }
    }
    printf("%d %d %d\n", a, b, c);
  }
  return 0;
}
