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 n, a, b, a1, b1;
int main() {
  cin >> n;
  a = (n - 1) / 2;
  b = (n - 1) / 2 + (n - 1) % 2;
  a1 = a % 3;
  b1 = b % 3;
  if (a1 == 1 && b1 == 0) {
    cout << 1 << " " << b - 1 << " " << a + 1;
    return 0;
  }
  if (a1 == 0 && b1 == 1) {
    cout << 1 << " " << a - 1 << " " << b + 1;
    return 0;
  }
  if (a1 == 2 && b1 == 0) {
    cout << 1 << " " << a - 1 << " " << b + 1;
    return 0;
  }
  if (a1 == 0 && b1 == 2) {
    cout << 1 << " " << b - 1 << " " << a + 1;
  }
  if (a1 == 0 && b1 == 0) {
    cout << 1 << " " << a - 1 << " " << b + 1;
    return 0;
  }
  cout << 1 << " " << a << " " << b;
}
