#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

void solve() {
    ll n;
    cin >> n;
    ll cnt = 0;
    rep(i, 0, 40) {
        if((1LL<<i) > n) break;
        if(((1LL<<i) & n)) cnt++;
    }
    if(cnt == 1) cout << "-1 -1 -1\n";
    else {
        ll a, b, c;
        a = n;
        rep(i, 0, 40) {
            if((1LL<<i) > n) break;
            if(((1LL<<i) & n)) {
                b = 1LL<<i;
                break;
            }
        }
        c = n - b;
        cout << a << " " << b << " " << c << "\n";
        cerr << (a | b) << " " << (b | c) << " " << (c | a) << "\n";
        cerr << (a ^ b ^ c) << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}