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

typedef long long ll;

long long findHigh(long long n) {
    ll start = n;
    ll last_idx = 0;
    for (ll i = 1; i <= n; i *= 2) {
        if ((n & i)) last_idx = i;
    }
    long long target = __builtin_popcount(n);
    for (long long i=1; i <= n; i *= 2) {
        if (n & i) {
            n += i;
            break;
        }
    }
    long long missing = target - __builtin_popcount(n);
    long long i = 1;
    while (missing-- > 0) {
        if (!(n & i)) {
            n += i;
            i *= 2;
        }
    }

    if ((n & (last_idx * 2)) == 1) return -1;
    if (__builtin_popcount(n) != __builtin_popcount(start)) return -1;
    return (start == n) ? -1 : n;
}

ll findLow(ll n) {
    ll start = n;
    for (long long i=2; i <= n; i *= 2) {
        if (n & i && !(n & (i / 2))) {
            n ^= 3 * i / 2;
            break;
        }
    }
    return (n == start) ? -1 : n;
}

int main()
{
    ll n;
    cin >> n;
    cout << findLow(n) << '\n' << findHigh(n) << '\n';
    return 0;
}