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

using namespace std;

lli N, kovval, elozoval;
int i, result;
char ch;
bool elozo[64], kov[64], nincs_elozo;

int main() {

    cin >> N;

    while(N) {
        elozo[63 - i] = kov[63 - i] = N & 1;
        N >>= 1;
        ++i;
    }

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

    for(i = 0; i < 64 * nincs_elozo; ++i) {
        elozoval = (elozoval << 1) ^ elozo[i];
    }

    for(i = 0; i < 64; ++i) {
        kovval = (kovval << 1) ^ kov[i];
    }

    cout << elozoval * nincs_elozo - !nincs_elozo  << "\n" << kovval << "\n";

}