#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
#include <cassert>
#include <complex>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
const int inf = 1e8;


ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

int cnt[1000010];

void init(int n){
    cnt[0]=0;
    for(int i=1;i<=n;i++){
        int t = i;
        int c = 0;
        while(t%2==0){
            c++;
            t/=2;
        }
        cnt[i] = cnt[i-1]+c;
    }
    return;
}

int main() {
    ll n;
    cin>>n;
    ll v = 0;
    for(int i=0;i<64;i++){
        if((n>>i)&1)v++;
    }
    cout<<n+1-(1LL<<v)<<endl;
}