#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

ll d;

ll jump(ll c, ll cnt){
    ll tmp = c;
    ll len = 0;
    for(int i = 0; i < cnt; i++){
        len += tmp;
        tmp /= 2;
    }
    return len;
}

ll calc_min(int cnt){
    ll l = 0, r = 1e18;
    while(r-l > 1){
        ll c = (l+r)/2;
        if(jump(c, cnt) >= d) r = c;
        else l = c;
    }
    return r;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    d; cin >> d;
    ll ans = 2e18;
    for(int i = 1; i <= 60; i++){
        ll tmp = calc_min(i);
        if(jump(tmp, i) == d) chmin(ans, tmp);
    }
    cout << ans << endl;
}