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.
        long sum=0;
        long temp = 0;
        long quo;
        for(int i=0; i<a.length; i++)
        {
            temp = a[i];
            sum = sum + a[i];
            while(temp%2==0)
            {
               quo =temp/2;
                sum = sum + quo;
                temp = quo;
            }
            if(temp%2!=0)
            {
                sum = sum+1;
            }
        }
        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();
    }
}