#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n;
    cin >> n;
    int32_t c = 0, t = n;
    while ((t & 0b1) == 0) {
        t >>= 1;
        ++c;
    }
    if (t == 1) {
        cout << "-1 -1 -1" << endl;
        return 0;
    }
    cout << n << " " << (1 << c) << " " << ((t >> 1) << (c + 1)) << endl;
    return 0;
}