#include<bits//stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;
ll mod = 1e9+7;
ll mod_pow(ll x, ll n, ll mod){
    ll res = 1;
    while(n > 0){
        if(n & 1) res = res*x%mod;
        x = x*x%mod;
        n >>= 1;
    }
    return res;
}
int main(){
    int n,k = 1;cin >>n;
    if(__builtin_popcount(n)==1){
        cout <<-1 << " " << -1<< " " << -1 << endl;
        return 0;
    }else{
        int a=0,b=0,cnt = 0,i=0;
        while(n >= k){
            if(n&(1<<cnt)){
                if(i%2==0) a+=k;
                else b+=k;
                i++;
            }cnt++;
            k*=2;
        }
        cout << a << " "<< b <<" " << n <<endl;
    }
}