#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
using ll=long long;
typedef pair<int, int> P;
ll calc(ll x, int k){
    ll res=0;
    for(int i=0; i<k; i++){
        res+=x;
        x>>=1;
    }
    return res;
}
int main()
{
    ll d; cin>>d;
    ll ans=d;
    for(int k=1; k<=60; k++){
        ll l=0, r=2e18;
        while(r-l>1){
            ll m=(l+r)/2;
            if(calc(m, k)>=d){
                r=m;
            }else{
                l=m;
            }
        }
        if(calc(r, k)==d){
            ans=min(ans, r);
        }
    }
    cout<<ans<<endl;
    return 0;
}