#include <iostream>

using namespace std;

long long N;

int bitcount(long long n) {
    int result = 0;
    while (n) {
        n &= n - 1;
        ++result;
    }
    return result;
}

long long following(long long n) {
    n |= n - 1;
    ++n;
    n += (1LL << bitcount(N) - bitcount(n)) - 1;
    return n;
}

long long previous(long long n) {
    n &= n + 1;
    --n;
    n ^= (1LL << bitcount(n) - bitcount(N)) - 1;
    return n;
}

int main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N;
    cout << (bitcount(N + 1) == 1 ? -1 : previous(N)) << '\n' << following(N) << '\n';
}