#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    long long N;
    cin >> N;
    vector<int> ni(35);
    int ind = 0;
    while(N > 0){
        ni[ind] = N % 2;
        N >>= 1;
        ind++;
    }
    int cnt = 0;
    for(int i = 0; i < 35; i++){
        if(ni[i] == 1) cnt++;
    }
    if(cnt <= 1){
        cout << -1 << ' ' << -1 << ' ' << -1 << endl;
        return 0;
    }
    long long A = 0, B = 0, C = 0;
    int flag = 0;
    for(int i = 0; i < 35; i++){
        if(ni[i] == 1 && flag == 0){
            A += (1LL << i);
            B += (1LL << i);
            flag = 1;
        }
        else if(ni[i] == 1 && flag == 1){
            B += (1LL << i);
            C += (1LL << i);
        }
    }
    cout << A << ' ' << B << ' ' << C << endl;
}