#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll D;
  cin>>D;

  ll ans=D;
  for(int k=1;k<=60;k++){
    ll ok=D,ng=0;
    while(abs(ok-ng)>1){
      ll mid=(ok+ng)/2;
      ll res=0;
      ll val=mid;
      for(int i=0;i<k;i++){
        res+=val;
        val/=2;
        if(res>D) break;
      }
      if(res>=D) ok=mid;
      else ng=mid;
    }

    ll res=0;
    ll val=ok;
    for(int i=0;i<k;i++){
      res+=val;
      val/=2;
      if(res>D) break;
    }
    if(res==D) chmin(ans,ok);
  }
  cout<<ans<<endl;

  return 0;
}