#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;

template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    if(__builtin_popcount(n) == 1) puts("-1 -1 -1");
    else {
        int a = -1, b = -1;
        for (int i = 0; i <= 30; ++i) {
            if(n & (1 << i)){
                if(a == -1) a = i;
                else b = i;
            }
        }
        printf("%d %d %d\n", n, (1 << a), n^(1 << a));
    }
    return 0;
}