#include <bits/stdc++.h>
using namespace std;

int nextSamePopcount(int x) {
    int c = x & -x;
    int r = x + c;
    return (((r ^ x) >> 2) / c) | r;
}

int prevSamePopcount(int x) {
    int temp = x;
    int c1 = 0, c0 = 0;

    while ((temp & 1) == 1) {
        c1++;
        temp >>= 1;
    }
    while (((temp & 1) == 0) && temp != 0) {
        c0++;
        temp >>= 1;
    }

    int p = c0 + c1;
    if (p == 0) return -1;

    x &= (~0 << (p + 1));
    int mask = (1 << (c1 + 1)) - 1;
    x |= mask << (c0 - 1);

    return x;
}

int main() {
    int n;
    cin >> n;

    cout << prevSamePopcount(n) << endl;
    cout << nextSamePopcount(n);

    return 0;
}