#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = unsigned __int128_t;
using mint = atcoder::static_modint<998244353>;
const int mod = 998244353;
#include <chrono>
mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1};
int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
template<class T>
bool chmin(T& a, const T& b){
    if (b < a){
        a = b;
        return true;
    }
    else { 
        return false;
    }
}
template<class T> 
bool chmax(T& a, const T& b){
    if (a < b){
        a = b;
        return true;
    }
    else {
        return false;
    }
}

void solve(){
    ll d;
    cin >> d;
    auto calc = [&](ll now, int cnt) -> ll{
        ll sum = now;
        for (int i = 0; i < cnt; i++){
            now /= 2;
            sum += now;
        }
        return sum;
    };
    ll ans = d;
    for (int i = 1; i < 80; i++){
        ll l = 0, r = 2e18;
        while(r - l > 1){
            ll mid = (l + r) / 2;
            if (calc(mid, i) <= d - 1){
                l = mid;
            }
            else {
                r = mid;
            }
        }
        if (calc(r, i) == d){
            chmin(ans, r);
        }
    }
    cout << ans << '\n';
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;   
    while(t--){
        cout << fixed << setprecision(15);          
        solve();
    }   
}