import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.util.ArrayDeque;
import java.util.Queue;
import java.util.HashSet;

public class Main {
    public static void main(String[] args) {
        FastScanner fs = new FastScanner();
        long h = fs.nextLong();
        long count = 1;
        long j = 1;
        while(h > 1){
          h = h/2;
          count +=  Math.pow(2,j);
          j++;
        }
        System.out.println(count);
  }
  public static int[] quickSort(int[] input) {
	return quick(input, 0, input.length - 1);
}

private static int[] quick(int[] input, int left, int right) {
	int[] array = input;
	int currentLeft = left;
	int currentRight = right;

	// 要素数が1以下のときは、何もせず返却する
	if (array.length < 2)
		return array;

	// クイックソートの場合、軸の選び方は色々あるが、このメソッドでは
	// 軸は、currentLeftとcurrentRightの真ん中にある要素とする。
	int pivot = array[(currentLeft + currentRight) / 2];

	do {
		while (array[currentLeft] < pivot) {
			currentLeft++;
		}

		while (array[currentRight] > pivot) {
			currentRight--;
		}
		if (currentLeft <= currentRight) {
			int index1 = currentLeft++;
			int index2 = currentRight--;
			int temp = array[index1];
			array[index1] = array[index2];
			array[index2] = temp;
		}
	} while (currentLeft <= currentRight);

	if (left < currentRight)
		quick(array, left, currentRight);

	if (currentLeft < right)
		quick(array, currentLeft, right);
	return array;
}
  public static int calcMin(int[] array) {

    int intMin = array[0];

    for (int i = 1; i < array.length; i++ ) {
        if(intMin > array[i]) {
            intMin = array[i];
        }
    }
    return intMin;
}
}
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte(){
        if(ptr < buflen){
            return true;
        }else{
            ptr = 0;
            try{
                buflen = in.read(buffer);
            }catch(IOException e){
                e.printStackTrace();
            }
            if(buflen <=0){
                return false;
            }
        }
        return true;
    }

    private int readByte(){
        if(hasNextByte())return buffer[ptr++];
        else return -1;
    }

    private static boolean isPrintableChar(int c){
        return 33<=c && c<=126;
    }
    public boolean hasNext(){
        while(hasNextByte() && !isPrintableChar(buffer[ptr]))ptr++;
        return hasNextByte();
    }

    public String next(){
        if(!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong(){
        if(!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        if(b < '0' || '9' < b){
            throw new NumberFormatException();
        }
        while(true){
            if('0' <= b && b<='9'){
                n*=10;
                n+=b-'0';
            }else if(b==-1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt(){
        long nl = nextLong();
        if(nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDoutble(){return Double.parseDouble(next());}
}


Measured memory_bytes: 23124