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 n = a.length;
        long sum = 0;
       forloop: for(int i=0; i < n; i++){
            sum = sum + 1;
            if (a[i] == 1){
                sum = sum + 1;
                continue forloop;
            }
        while (a[i]%2 == 0){
            long n1 = a[i]/2;
            a[i] = n1;
            sum = sum + n1;
        }
            
        while (a[i]%2 == 1){
            sum = sum + a[i] + 1;
            a[i] = a[i]/2;
        }
            
              
            
            //System.out.println("sum = " + sum);
        }
        return sum;
        
        //  Return the length of the longest possible sequence of moves.
    }

    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();
    }
}