#include <bits/stdc++.h>
#define ll long long
#define S 42

using namespace std;

ll N, kovval = 0, elozoval = 0, i;
bool elozo[S], kov[S], nincs_elozo;

int main() {

    cin >> N;

    for(ll i = 0; i < S; i++) {
        kov[S-1-i] = elozo[S-1-i] = N & (1LL << i);
    }

    nincs_elozo = prev_permutation(elozo, elozo + S);
    next_permutation(kov, kov + S);

    for(i = (S-1)*nincs_elozo; i >= 0; --i) {
        elozoval |= ((ll)elozo[i] << (S-1-i));
    }
    for(i = S-1; i >= 0; --i) {
        kovval |= ((ll)kov[i] << (S-1-i));
    }

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