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() {
  long long n, m;
  cin >> n;
  m = n / 2;
  long long i, j, k;
  for (i = m;; i--) {
    if (i % 3 == 0) {
      i--;
    }
    for (j = i, k = (n - i) - j;;) {
      if ((j % 3 == 0)) {
        j--;
      }
      if ((n - i) - j <= 0) {
        j--;
        continue;
      }
      k = (n - i) - j;
      if (k % 3 == 0) {
        k++;
        j--;
      } else {
        cout << i << " " << j << " " << k << endl;
        return 0;
      }
    }
  }
}
