#include<cstdio>
long long pow2[55];

int main(){
    long long n;
    scanf("%lld",&n);
    long long base = 1;
    int find = 0;
    pow2[0] = 1;
    for(int i = 1; i < 40; i++){
        pow2[i] = pow2[i-1]*2ll;
        if(n==base) find = 1;
        base *= 2ll;
    }
    if(find) printf("-1 -1 -1\n");
    else{
        long long a = 0, b = 0, c = 0;
        int cnt = 0;
        for(int i = 0; i <= 40; i++){
            if(n&pow2[i]){
                cnt++;
                if(cnt==1) a += pow2[i], b += pow2[i];
                else b += pow2[i], c += pow2[i];
            }
        }
        printf("%lld %lld %lld\n",a,b,c);
    }
    return 0;
}