#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(x) x.begin(), x.end()
#define MOD1 1LL<<61-1
#define MOD2 (1LL<<61)-1
#define MOD3 (1LL<<61-1)
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
//#include <atcoder/all>
//using namespace atcoder;
////using mint=static_modint<998244353>;
//using mint=static_modint<1000000007>;
////using mint=modint;
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
int inf=2147483647;
ll INF=9223372036854775807;
const ld PI=acos(-1);

void yn(bool f){
	if(f)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return;
}

string base10to2(ll n){
    if(n==0)return "0";
    string a="";
    while(n>0){
        a=char(n%2+'0')+a;
        n/=2;
    }
    return a;
}

ll pow_mod(ll n,ll k){
    if(k==0)return 1;
    if(k%2==1)return pow_mod(n,k-1)*n;
    if(k%2==0){
        ll t=pow_mod(n,k/2);
        return t*t;
    }
}


int main(){
	ll n;cin>>n;
	string s=base10to2(n);

	ll a=0;
	rep(i,s.size())if(s[i]=='1')a++;

	cout<<pow_mod(2,a)-2<<endl;
	
}