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

public class codesprint12_1 {

    public static int powerN(int base, int n) {
        int result = 1;
        for (int i = 0; i < n; i++) {
            result *= base;
        }

        return result;
    }

    static long longestSequence(int n,long[] a) {
        long y=0;
        for(int i=0; i<n; i++) {
            long x=0;
            int j=0;
            if(a[i]==1) {
                x=1;
            }
            else if(a[i]==2) {
                x=3;
            }
            else if(a[i]%2==0 && a[i]!=2) {
                long p=a[i];
                while(p%2==0) {
                    j++;
                    p=p/2;

                }
                for(int q=1; q<j+1; q++) {
                    long po = powerN(2, q);
                    long temp=(a[i]/po);
                    x=temp+x;
                }
                x=1+a[i]+x;

            }
            else {
                x=1+a[i];
            }
            y=y+x;
        }
        return y;

    }

    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(n,a);
        System.out.println(result);
        in.close();
    }
}