#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

int main() {
  ll n;
  cin >> n;

  ll t = n;
  while (t % 2 == 0) {
    t /= 2;
  }
  if (t == 1) {
    cout << "-1 -1 -1" << endl;
    return 0;
  }

  REP(i, 30) {
    if ((1LL << i) & n) {
      ll a = 1LL << i, b = n - a, c = n;
      cout << a << " " << b << " " << c << endl;
      return 0;
    }
  }
}