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 count = 0;
        for(int i=0;i<a.length;i++) {
            long stickLen = a[i];
            long divideCount = 0;
            long currentNodeSize = a[i];
            long nodeCount = 1;

            while (currentNodeSize > 1) {
                for (int j=1;j<=12;j++) {
                    if(currentNodeSize % Math.pow(2,j) != 0 || currentNodeSize == Math.pow(2,j)) {
                        divideCount = divideCount + nodeCount;
                        nodeCount = nodeCount * (currentNodeSize / (long)Math.pow(2,j-1));
                        currentNodeSize = (long)Math.pow(2,j-1);
                        break;
                    }
                }
            }

            count = count + stickLen + divideCount;
        }
        return count;
    }

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