#include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<cstdio>
#define MAX 1000005
#include<stdio.h>
#include<vector>

#include<cstdlib>
#include<cassert>
#include<unordered_map>
#define ll long long
#define ld long double
#define lli long long int
#define pb push_back
#define INF 1000000000000
#define mod 1000000007
#define MOD 1000000007
//#define mp make_pair
#define loop(i,n) for (lli i = 0; i < n; i++)
#define FOR(i,a,b) for (lli i = a; i < b; i+=1)
#define loop_rev(i,n) for (lli i = n-1; i >= 0; i--)
#define FOR_REV(i,a,b) for (lli i = a; i >= b; i--)
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define F first
#define S second
#define mii map<lli,lli>
#define vi vector<lli>
#define vvi vector<lli>
#define itr :: iterator it
#define WL(t) while(t --)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) (a/gcd(a,b))*b
#define abs(x) ((x < 0)?-(x):x)

#define print(x) printf("%lli\n",x);
#define print2(x,y) printf("%lli %lli\n",x,y);
#define print3(x,y,z) printf("%lli %lli %lli\n",x,y,z);

#define scan(x) scanf("%lld",&x);
#define scan2(x,y) scanf("%lld %lld",&x,&y);
#define scan3(x,y,z) scanf("%lld %lld %lld",&x,&y,&z);

#define scanarr(a,n) for(lli i=0;i<n;i++)    cin>>a[i];
#define scanvector(a,n) for(lli i=0;i<n;i++){ lli x ; cin>>x; a.push_back(x);}

#define printarr(a,n) for(lli i=0;i<n;i++)   printf("%lli ",a[i]); printf("\n");
#define printvector(a,n) for(lli i=0;i<n;i++)   printf("%lli ",a[i]); printf("\n");

#define FD(N) fixed<<setprecision(N)

#define endl '\n'

#define deb(x) cout<<#x<<" "<<x<<endl;


lli find_mod(string s){
lli i,x=0;
for(i=0;i<s.length();i++)
    x=(x*10+s[i]-'0')%MOD;
return x;
}


lli prime[MAX+1];

void sieve1(){ //prime or not
    for(int i=0;i<=MAX;i++) prime[i]=1;
    prime[0]=prime[1]=0;
    for(lli i=4;i<=MAX;i+=2) prime[i]=0;
    for (int p=3; p*p<=MAX; p+=2){
        if (prime[p] == 1)
            for (int i=p*2; i<=MAX; i += p){
                prime[i] = 0;
}}}

int min_prime_div_of_n[MAX+1];

void sieve2(){ //smallest prime factor which divide a no.
memset(min_prime_div_of_n, 0, sizeof(min_prime_div_of_n));
	min_prime_div_of_n[0] = min_prime_div_of_n[1] = 1;
	for (int i = 2; i * i <= MAX; i++) {
		if (min_prime_div_of_n[i] == 0) {
			for (int j = i * 2; j < MAX; j += i) {
				if (min_prime_div_of_n[j] == 0){
					min_prime_div_of_n[j] = i;
					//cout<<min_prime_div_of_n[i]<<" ";}
			}
		}
	}
}
	for (int i = 2; i <=MAX; i++)
		if (min_prime_div_of_n[i] == 0)
			min_prime_div_of_n[i] = i;
		// If the number is prime then it's // smallest prime factor is the number // itself
}

int max_prime_div_of_n[MAX+1];

void sieve3(){ //maximum prime factor which divide a no.
    sieve1();
    memset(max_prime_div_of_n, 0, sizeof(max_prime_div_of_n));   //0 stands for is_prime
	max_prime_div_of_n[0] = max_prime_div_of_n[1] = 1;
	for (int i = 2; i * i <= MAX; i++) {
		if (max_prime_div_of_n[i] == 0) {
			for (int j = i * 2; j < MAX; j += i) {
				if (max_prime_div_of_n[j] == 0 || ((j%i)==0 && prime[i]==1) ){
					max_prime_div_of_n[j] = i;
                    }
			}
		}
	}
	for (int i = 2; i <=100; i++)
	    	// If the number is prime then it's largest prime factor is the number  itself
		if (max_prime_div_of_n[i] == 0) max_prime_div_of_n[i] = i;
			//cout<<max_prime_div_of_n[i]<<" ";

}

lli sum_prime_fac[1000001];

void sieve4(){ //prime or not
    sum_prime_fac[1000001] = {0};
    for(lli i=2;i<=1000000;i++){
            if(!sum_prime_fac[i]){
                    for(lli j=i;j<=1000000;j+=i)
                        sum_prime_fac[j]+=i;
            }
    }
}



bool is_even(lli n){ return(n%2==0);}

bool is_odd(lli n){ return(n%2==1);}

/*bool isPower(lli n)
{
	// Find Log n in different bases
	// and check if the value is an
	// integer
	float f=log(n)/log(2);
	if (((f - (int)f) == 0.0) && prime[int(f)]==1)
			return true;
	for (lli x=3; x<=sqrt(n); x+=2) {
		f = log(n) / log(x);
		if (((f - (int)f) == 0.0) && prime[int(f)]==1 && prime[x]==1 )
			return true;
	}
	return false;
}
*/
// memset(array_name , initialized value , sizeof(data_type_of_array))
lli sum(lli n){
    lli sum=0;
while(n){
    sum+=n%10;
    n/=10;
}
return sum;
}

bool isPrime(lli n){
if(n<=1) return false;
if(n<=3) return true;
if(n==5) return true;
if((n%2==0)||(n%3==0) || (n%5==0)) return false;
for(lli i=5;i*i<=n;i+=6)
    if((n%i==0)||(n%(i+2)==0))
        return false;
return true;
}

lli reversenum(lli x){
lli num=0;
while(x>0){
num=num*10+x%10;
x=x/10;
}
return num;
}

bool ispalindrome(string s){
string q = s;
reverse(q.begin(),q.end());
return(s==q);
}

bool isvowel(char x){
return(x=='a' || x== 'e' ||x=='i' || x== 'o' || x=='u' );
}

/*inline void fastRead(lli &x) {
	    register int c = getchar_unlocked();
	    x = 0;
	    int neg = 0;
	    for(; ((c<48 || c>57) && c != '-'); c = getchar_unlocked());
	    if(c=='-'){
	    	neg = 1;
	        c = getchar_unlocked();}
	    for(; c>47 && c<58 ; c = getchar_unlocked()){x = (x<<1) + (x<<3) + c - 48;}
	    if(neg){ x = -x;}
}*/



lli sumarr(lli a[],lli n){
    lli sum=0;
    loop(i,n) sum+=a[i];
    return sum;
}

ll modmul(ll a, ll b) {
	return ((a%mod) * (b%mod)) % mod;
}

ll modadd(ll a , ll b){
    return((a%mod)+(b%mod))%mod;
}

ll modsub(ll a , ll b){
    return((a%mod) - (b%mod) + mod)%mod;
}

lli fastexpo(lli a,lli b){
        a = a%mod;
        lli ans=1;
        while(b){
            if(b%2)
                ans=(ans*1ll*a)%mod;
            a=(a*1ll*a)%mod;
            b=b/2;
        }
        return ans;
  }

lli findmax(lli a[],lli x,lli y){

lli maxi=-1;
for(lli i=x;i<=y;i++){
maxi = max(maxi , a[i]);
}
return maxi;
}


lli phi[MAX];
void euler_phi(){ //euler totient function
loop(i,MAX-1)
    phi[i+1] = i+1;
for (lli p=2; p<MAX; p++){
    if (phi[p] == p){
        phi[p] = p-1;

        for (lli i = 2*p; i<MAX; i += p)
               phi[i] = (phi[i]/p) * (p-1);

        }
    }
}


void prime_factorise(lli n , map<lli,lli> &mp){

    while(n%2==0){
        mp[2]++;
        n/=2;
    }
    for(lli i=3;i*i<=n;i+=2){
        while(n%i==0){
            mp[i]++;
            n/=i;
        }
    }

    if(n>1) mp[n]++;

 }

// Returns largest power of p that divides n!
lli largestPower(lli n,lli p){

    lli total = 0;
    // Calculate x = n/p + n/(p^2) + n/(p^3) + ....
    while (n)
    {
        n /= p;
        total += n;
    }
    return total;
}

lli facto(lli n){
    lli ans = 1;
    for(lli i=1;i<=n;i++)
        ans = modmul(ans,i);
    return ans;
}

lli findncr(lli n,lli r){
    if(n<r)
        return 0;
    else{
        r = min(r,n-r);
        lli a=1,b=1;
    	    for(lli i=0;i<r;i++) {
    	        a = (a*(n-i))%mod;
    	        b = (b*(i+1))%mod;
    	    }
    	    a = modmul(a,fastexpo(b,mod-2));
    	    return a;
    }
}

bool iszero(string n){
    loop(i,n.length()){
        if(n[i]=='0')
            return true;
    }
    return false;
}

int main(){
fastIO
lli t=1;
//cin>>t;
//euler_phi();
while(t--){
    lli h,n,k;
    cin>>h;
    n = 2;
    lli m = 1;
    while (h != 1)
    {
        h/=2;
        m+=n;
        n*=2;
    }
    cout << m << endl;
}
return 0;
}


Measured memory_bytes: 256