#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<cstdint>
#include<cstddef>
#include<vector>
#include<cmath>
#include<numeric>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
using usize = size_t;
using u32 = uint_fast32_t;
using u64 = uint_fast64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
template<typename T>
using vec = vector<T>;
#define rep(i, n) for (i64 i = 0; i < (i64)(n); ++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define len(hoge) (i64)((hoge).size())
using P = pair<i64,i64>;
i64 d;
i64 calc(i64 n,i64 f){
    i64 res = 0;
    while(f--){
        res += n;
        n /= 2;
    }
    return res;
}
i64 binary_search(){
    i64 ans = 1e18 + 1;
    for(i32 i = 0; i <= log2(d) + 1; i++) {
        i64 lb = 0,ub = 1e18;
        while (ub - lb > 1) {
            i64 mid = (ub + lb) / 2;
            if (calc(mid,i) < d)lb = mid;
            else ub = mid;
        }
        if(calc(ub,i) == d)
        ans = min(ans,ub);
    }
    return ans;
}
int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cin >> d;
    cout << binary_search() << endl;
}