#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cstdio>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define debug(output) cout<<#output<<"= "<<output<<endl
using lint=long long;
int MOD=1000000007;

signed main(){
    int n;cin>>n;
    int a,b,c;
    if(__builtin_popcount(n)==1){
        a=-1;b=-1;c=-1;
    }
    else{
        a=n;
        b=n;
        c=n;
        bool flag=true;
        rep(i,31){
            if(n&(1<<i)){
                if(flag){
                    b-=(1<<i);
                    flag=false;
                }
                else{
                    c-=(1<<i);
                }
            }
        }
    }
    cout<<a<<" "<<b<<" "<<c<<endl;
    return 0;
}