#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll N;
  cin>>N;

  vector<ll> pos;
  for(ll i=0;i<=30;i++){
    if((1<<i)&N) pos.push_back(i);
  }
  if(pos.size()==1){
    cout<<-1<<" "<<-1<<" "<<-1<<endl;
    return 0;
  }

  ll base=(1ll<<pos[0]);
  ll rest=N-base;

  ll A=rest;
  ll B=base+rest;
  ll C=base;

  cout<<A<<" "<<B<<" "<<C<<endl;

  return 0;
}