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 steps= 0;
        for(int i=0;i<a.length;i++){
            long currentValue= a[i];
            if(currentValue>1){
                while(true){
                    steps+=currentValue;
                    if(currentValue%2 != 0){
                        steps+=1;
                        break;
                    }
                    currentValue = currentValue/2;
                }    
            } else{
                steps+=1;
            }
        }
        return steps;
    }
    
    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();
    }
}