nyoj412_bitset_

#include <iostream>
#include <cstdio>
#include <bitset>

using namespace std;

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF){
        bitset<32> b(n);
        int j;
        int cou=0;
        for(int i=0;i<32;i++){
            if(b[i]){
                cou++;
            }
            if(b[i]&&!b[i+1]){
                j=i;
                b[i]=false;
                b[i+1]=true;
                break;
            }
        }
        cou--;

            for(int k=0;k<cou;k++){
                b[k]=true;
            }
            for(int k=cou;k<j;k++){
                b[k]=false;
            }

        printf("%ld\n",b.to_ulong());
        //cout<<b.to_ulong()<<endl();

    }
    return 0;
}