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 n, k, j, i, m;
  scanf("%lld", &n);
  m = n / 3;
  for (i = m;; i--) {
    if (i % 3 != 0) {
      for (j = m; j < m + 10000; j++) {
        if (j % 3 != 0) {
          for (k = m; k < m + 10000; k++) {
            if (k % 3 != 0 && i + k + j == n) {
              goto exit;
            }
          }
        }
      }
    }
  }
exit:
  printf("%lld %lld %lld\n", i, j, k);
  return 0;
}
