#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    ll D;
    cin >> D;
    ll res = D;
    ll two = 2;
    for(int i = 2; two <= D; i++, two *= 2) {
        ll lb = 0, ub = D;
        while(ub - lb > 1) {
            ll mid = (ub + lb) / 2;
            ll tmp = mid;
            ll dist = 0;
            rep(j, i) {
                dist += tmp;
                tmp /= 2;
            }
            if(dist >= D) {
                ub = mid;
            } else {
                lb = mid;
            }
        }
        ll ubt = ub;
        ll tmp = 0;
        rep(j, i) {
            tmp += ubt;
            ubt /= 2;
        }
        if(tmp == D)
            res = ub;
    }

    cout << res << endl;
}