// author : kalyan
	#include "bits/stdc++.h"
	#define ll long long
	#define endl '\n'
	#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); 
	using namespace std;


	void solve(){
	    ll n;
	    cin >> n;
	    ll cnt = __builtin_popcount(n);
	    // debug(cnt);
	    if(cnt%2 == 0){
	    	ll b = 0,c = 0;
	    	bool ok = false;
	  		ll count = 0;
	    	for(ll i = 31; i >= 0; i--){
	    		ll k = n >> i;
	    		if(k&1){
	    			if(!ok){
	    				count++;
	    				b += pow(2,i);
	    				if(count == cnt/2)
	    					ok = true;
	    			}
	    			else{	
	    				c += pow(2,i);
	    			}
	    		}
	    	}
	    	cout << n << " " << b << " " << c << endl;
	    }
	    else{
	    	cout << "-1 -1 -1\n";
	    }
	    
	}  


	int main(){
	    fastio;
	    ll t;
	    t = 1;
	    // cin >> t;
	    // ll i = 1;
	    while(t--){
	        // cout << "Case #" << i << ": ";
	        solve();
	        // i++;
	    }
	    return 0;
	}