#include <iostream>
#include <algorithm>
//#include <cmath>
#include <vector>

using namespace std;

int main()
{
    long long n;
    cin>>n;
    vector<int>lo;
    vector<int>up;
    while(n>0)
    {
        lo.insert(lo.begin(), n%2);
        up.insert(up.begin(), n%2);
        n/=2;

    }
    lo.insert(lo.begin(), 0);
    up.insert(up.begin(), 0);
    if(prev_permutation(lo.begin(), lo.end()))
    {
        long long x=0, t=1;
        for(int i=lo.size()-1; i>=0; i--)
        {
            x+=(lo[i]*t);
            t*=2;
        }
        cout<<x;
    }
    else cout << -1;
    cout << endl;
    if(next_permutation(up.begin(), up.end()))
    {
        long long x=0, t=1;
        for(int i=up.size()-1; i>=0; i--)
        {
            x+=(up[i]*t);
            t*=2;
        }
        cout<<x;
    }
    else cout << -1;

    /* bool f0=false, f1=false;
     for(int i=0; i<k.size(); i++)
     {
         if(k[i]==0 and f0==false){
             f0=true;
             lo[i]=1;
         }
         if(k[i]==1 and f1==false){
             f1=true;
             lo[i]=0;
         }
     }
     int kisebb=0, t=1;
     for(int i=0; i<lo.size(); i++){
         kisebb+=(lo[i])*t;
         t*=2;
     }
     cout<<kisebb<<endl;
     reverse(up.begin(), up.end());
     f0=false, f1=false;
     for(int i=0; i<k.size(); i++)
     {
         if(k[i]==0 and f0==false){
             f0=true;
             lo[i]=1;
         }
         if(k[i]==1 and f1==false){
             f1=true;
             lo[i]=0;
         }
     }
     reverse(up.begin(), up.end());
     int nagyobb=0;
     t=1;
     for(int i=0; i<up.size(); i++){
         nagyobb+=(lo[i])*t;
         t*=2;
     }
     cout<<nagyobb;*/
    return 0;
}