#include <bits/stdc++.h>
//#include <iostream>
#include <atcoder/all>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
using namespace atcoder;
typedef long long ll;
const int MOD = 1000000007;
//const int MOD =  998244353;
 
const ll INF = 1LL<<61;
const int IINF = 1000000000;
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; }

typedef pair<int, int> PI;
typedef pair<ll, ll> P;
typedef pair<string, ll> PS;

using mint = modint1000000007;

int main(){

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N; cin >> N;
    vector<int> bit(32,0);
    ll n = N;
    rep(i,32){
        bit[i] = n%2;
        n /= 2;
    }
    
    ll A = 0;
    ll B = 0;
    ll multi = 1;
    rep(i,32){
        if (bit[i] == 1){
            if(A == 0){
                A += multi;
            }
            else{
                B += multi;
            }
        }
        multi *= 2;
    }
    ll C = N;

    if(B == 0) A = -1, B = -1, C = -1;
    cout << A << " " << B << " " << C << endl;

}