#include <bits/stdc++.h>

using namespace std;
void re(string a)
{
    long long m=0, d=1;
    for(int i=a.length()-1; i>=0; i--)
    {
        m+=d*(a[i]-'0');
        d*=2;
    }
    cout << m << endl;
}
int main()
{
    long long n;
    cin >> n;
    string a="", b;
    while(n)
    {
        a=char(n%2+'0')+a;
        n/=2;
    }
    a='0'+a;
    b=a;
    if(prev_permutation(b.begin(), b.end()))
    {
        re(b);
    }
    else cout << -1;
    next_permutation(a.begin(), a.end());
    re(a);
    return 0;
}