#include <bits/stdc++.h>
#define lli long long int

using namespace std;

int main() {

    iostream::sync_with_stdio(0);
    cin.tie(0);

    lli N;
    cin >> N;

    vector<bool> elozo(64, 0), kov(64, 0);
    int i = 63;
    while(N) {
        elozo[i] = kov[i] = N & 1;
        N >>= 1;
        i--;
    }

    bool nincs_elozo = prev_permutation(elozo.begin(), elozo.end());
    next_permutation(kov.begin(), kov.end());

    lli kovval = 0, elozoval = 0;
    for(int i = 0; i < 64; i++) {
        kovval = (kovval << 1) ^ kov[i];
        elozoval = (elozoval << 1) ^ elozo[i];
    }

    cout << (nincs_elozo ? elozoval : -1) << "\n" << kovval << "\n";

}