#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

ll solve(ll D, ll x, ll cnt){
  __int128 p = 0;
  __int128 xx = x;
  rep(i,cnt){
    p += xx;
    xx /= 2;
    if(p > (__int128)D) return D+1;
  }
  return (ll)(p);
}


int main(){
  ll D;
  cin >> D;

  ll ret = D;
  REP(i,1,65){
    ll lb = 1, ub = D+1;
    while(ub-lb>1){
      ll m = lb + (ub-lb)/2;
      if(solve(D, m, i) < D) lb = m;
      else ub = m;
    }
    ll res = solve(D, ub, i);
    if(res == D){
      ret = min(ret, ub);
    }
  }

  cout << ret << endl;
  
  return 0;
}