
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long num = Long.parseLong(sc.nextLine());
		Main main = new Main();
		int pow = main.divcount(num, 0);
		double ans = 0;
		for (int i = 0; i <= pow; i++) {
			ans += Math.pow(2, i);
		}
		System.out.println((long)ans);
	}

	public int divcount(long num,int con) {
		if (num > 1) {
			return divcount(num / 2, ++con);
		}
		return con;
	}

}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz