import java.io.*;
import java.util.*;
import java.math.*;

 
 public class Main	{
   static class Pair implements Comparable<Pair>{
   long a;
   int b;
   public Pair(long x,int y){a=x;b=y;}
   public Pair(){}
   public int compareTo(Pair p){
      return Long.compare(p.a, a);
   }
 }
static class TrieNode{
  TrieNode[]child;
  int w;
  boolean term;
  TrieNode(){
    child = new TrieNode[26];  
  }
}
  public static int gcd(int a,int b)
  {
    if(a<b)

      return gcd(b,a);
    if(b==0)
      return a;
    return gcd(b,a%b);
    
  }
  //static long ans = 0;
  static long mod =(long)(1e9+7); //998244353;//
   
    public static void main(String[] args) throws Exception {
       new Thread(null, null, "Anshum Gupta", 99999999) {
            public void run() {
                try {
                    solve();
                } catch(Exception e) {
                    e.printStackTrace();
                    System.exit(1);
                }
            }
        }.start();
    }

static long pow(long x,long y){
    if(y == 0)return 1;
    if(y==1)return x;
    long a = pow(x,y/2);
    a = (a*a)%mod;
    if(y%2==0){
        return a;
    }
    return (a*x)%mod;
}

static long mxx;
static int mxN = (int)(1e5+5);
static long[]fact,inv_fact;
static long my_inv(long a) {
	return pow(a,mod-2);
}
static long bin(int a,int b) {
    return ((fact[a]*inv_fact[a-b])%mod * inv_fact[b])%mod;
}
static long count(long x) {
	return x*(x+1)/2;
}
static ArrayList<ArrayList<Integer>>adj ;
static boolean[]vis;
static long[]ans,sep_ss,ss;
static int[]c;
static void dfs(int sv) {
	vis[sv] = true;
	long temp = sep_ss[c[sv]];
	for(int i=0;i<adj.get(sv).size();i++) {
		int x = adj.get(sv).get(i);
		if(!vis[x])
			{
			   sep_ss[c[sv]] = 0;
			   dfs(x);
			   ans[c[sv]] += count(ss[x] - sep_ss[c[sv]]);
			}	
		
	}
	sep_ss[c[sv]] = temp + ss[sv];
}
static void calc(int sv) {
	vis[sv] = true;
	ss[sv]=1;
	for(int i=0;i<adj.get(sv).size();i++) {
		int x = adj.get(sv).get(i);
		if(!vis[x])
			{
			   calc(x);
			   ss[sv] += ss[x];
			}
	}
}
static long find(long h) {
	if(h==1) {
		return 1;
	}
	if(h<=0)return 0;
	long ans = 1;
	ans += find(h/2)*2;
	return ans;
}
 public static void solve() throws Exception {
   // solve the problem here
   MyScanner s = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out), true);
        int t = 1;//s.nextInt();
        mxx = (long)(1e18+5);
 
        while(t-->0){
        	long h = s.nextLong();
        	out.println(find(h));
        }
           
        out.flush();
}
 
     
 
 
 
    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
 
    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
 
        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
 
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt() { return Integer.parseInt(next()); }
        long nextLong() { return Long.parseLong(next()); }
        double nextDouble() { return Double.parseDouble(next()); }
         
        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    //--------------------------------------------------------
}


Measured memory_bytes: 25556