#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define INF 1000000001
#define mod 1000000007
using namespace std;

int main(){
	//cin.tie(0);
	//ios::sync_with_stdio(false);
	
	ll n;
	cin>>n;
	if(n==0){
		cout<<0<<endl;
		return 0;
	}
	ll n2=n;
	vector<ll> x;
	ll i=2;
	x.push_back(1);
	while(x[x.size()-1]<=n){
		x.push_back(i);
		i*=2;
	}
	x.pop_back();
	reverse(x.begin(),x.end());
	rep(i,x.size()){
		//cout<<x[i]<<endl;
	}
	ll ans=1;
	rep(i,x.size()){
		if(n>=x[i]){
			ans*=2;
			n-=x[i];
		}
	}
	//ans/=2;
	cout<<n2+1-ans<<endl;

}