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

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long sum=0,n,p=1;
        double k=0;
        for(int i=0;i<a.length;i++){
            if(a[i]==1){
                sum++;   
            }else if(a[i]%2==0){
                n=a[i]/2;
                while(p<n){p*=2;k++;}
                k--;
                sum++;
                for(int j=(int)k;j>=0;j--){
                    sum+=(a[i]/Math.pow(2,j));
                }
            }else{
                long t=a[i]+1;
                sum+=t;
            }    
        }
        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();
    }
}