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

public class Solution {

    static long longestSequence(long[] a) {
        long sum=0,n;
        for(int i=0;i<a.length;i++){
            n=a[i];
            sum+=n;
            while(n>0){
                if(n==1)
                {
                    
                    break;
                } 
                if(n%2==1&&n>1)
                {
                    sum+=1;
                    break;
                    
                }  
                if(n%2==0){
                    sum+=n/2;
                    n=n/2;
                }
            }
        }
        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();
    }
}