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

typedef long long ll;

ll findHigh(ll n) {
    ll c = n, c0 = 0, c1 = 0;
    while ((c & 1) == 0 && c != 0 ) {
        c0++;
        c >>= 1;
    }
    while ((c & 1) == 1) {
        c1++;
        c >>= 1;
    }
    if (c0 + c1 == 0 || c0 + c1 == 63) return -1;
    return n + (1LL << c0) + (1LL << (c1 - 1)) - 1;
}

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;
}