#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
const int INF = 1 << 30;
const int mod = 1e9 + 7;
void solve() {
  long long n;
  cin >> n;
  if (n % 3 == 2) {
    printf("1 2 %lld\n", n - 3);
  } else {
    printf("1 1 %lld\n", n - 2);
  }
  return;
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
