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

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        ArrayList<Long> al = new ArrayList<Long>();
        long sum=0,temp=0,box=0,box1=0,temp1=0;
        int si=0;
        int n= a.length;
        Arrays.sort(a);
        
        for(int i=0 ; i<n; i++){
            temp=0;box=0; box1=0;
            if(((a[i])&(a[i]-1))==0){
            temp=(2*a[i])-1;
          }else{
                box1=a[i];
                while(box1>0){
                    a[i]=box1;
                    if(a[i]!=1){
                while(((a[i])&(a[i]-1))!=0){
                    a[i]=a[i]-1;
                }}
                    al.add(a[i]);
                box1=box1-a[i];
                }
                si=al.size();
                for(int j=0; j<si-1 ; j++){
                   
                    box=(2*al.get(j))-1;
                    temp=temp+box;
                }
                if((al.get(si-1))==1){
                    temp= temp+1;
                }else{
                    temp= temp+(2*al.get(si-1))-1;
                }
               
            }
            
            sum=sum+temp;   
        }
     
        return sum;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}