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>
int main() {
  long long int n, a = 0, b = 0, c = 0, i;
  scanf("%I64d", &n);
  for (i = 1; i <= n; i++) {
    if (i % 3 != 0) {
      a = i;
      if (n > 2 * i) {
        b = i;
        if ((n - 2 * i) % 3 != 0) {
          c = n - 2 * i;
          break;
        }
      }
    }
  }
  printf("%I64d %I64d %I64d", a, b, c);
  return 0;
}
