#include using namespace std; #define INF_LL (int64)1e18 #define INF (int32)1e9 #define REP(i, n) for(int64 i = 0;i < (n);i++) #define FOR(i, a, b) for(int64 i = (a);i < (b);i++) #define all(x) x.begin(),x.end() #define fs first #define sc second using int32 = int_fast32_t; using uint32 = uint_fast32_t; using int64 = int_fast64_t; using uint64 = uint_fast64_t; using PII = pair; using PLL = pair; const double eps = 1e-10; templateinline void chmin(A &a, B b){if(a > b) a = b;} templateinline void chmax(A &a, B b){if(a < b) a = b;} template vector make_v(size_t a){return vector(a);} template auto make_v(size_t a,Ts... ts){ return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value!=0>::type fill_v(U &u,const V... v){u=U(v...);} template typename enable_if::value==0>::type fill_v(U &u,const V... v){ for(auto &e:u) fill_v(e,v...); } int main(void) { cin.tie(0); ios::sync_with_stdio(false); int64 D; cin >> D; int64 l = 0, r = 2*D+2, m; auto ok = [&](int64 x) { int64 sum = 0; while (x) { sum += x; x /= 2; } return sum >= D; }; while (r - l > 1) { m = (l + r) / 2; if (ok(m)) { r = m; } else { l = m; } } while (1) { int64 sum = 0; int64 rr = r; while (sum < D) { sum += rr; rr /= 2; } if (sum == D) { cout << r << endl; return 0; } r++; } }