#include <bits/stdc++.h>
#define ll long long
#define rep(i,x,n) for(ll i=x;i<n;i++)
#define rrep(i,x,n) for(ll i=x;i>=n;i--)
using namespace std;
ll mod=1000000007;
void solve(){
  ll d;
  cin>>d;
  ll init=d;
  ll mx=floor(log2(d));
  // ll dp[mx][mx];
  ll sum=0,ans=(1LL<<(mx-1LL));
  d-=((1LL<<mx) -1LL);
  // cout<<d<<endl;
  // cout<<((1LL<<mx) -1LL)<<endl;
  // cout<<d<<" "<<mx<<endl;
  if(d<=0){
    cout<<ans<<endl;return;
  }
  // cout<<d<<" "<<ans<<endl;
  // vector<int> v1LL;
  ll res=LLONG_MAX;
  rrep(i,mx-2,0){
    if(d-(1LL<<(i+1LL))+1LL >0) {d-= ((1LL<<(i+1LL))-1LL); ans+= (1LL<<i);}
    else if(d-(1LL<<(i+1LL))+1LL == 0) {d-= ((1LL<<(i+1LL))-1LL); ans+=( 1LL<<i); break;}
    else{
      res=min(res,ans+(1LL<<i));
    }
  }
  // cout<<d<<endl;
  if(d>0) ans=min(init,res);
  cout<<min(res,ans)<<endl;
}
int32_t main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
}