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

public class Solution {

    static long longestSequence(long[] a, int n) {
        long sum =0;
        for(int i=0;i<n;i++)
        {
            long s;
            if(a[i]%2==1){
            s=1;
            if(a[i]!=1)
            {
                while(a[i]%2==0)
                {
                s = s+(a[i]/2);
                a[i]=a[i]/2;
                }
                 s=s+a[i];
            }
           
            }
            else{
                s=a[i];
                while(a[i]/2!=0)
                {
                    s = s+(a[i]/2);
                    a[i]=a[i]/2;
                }
            }
            //System.out.print(s+" ");
            sum+=s;
        }
        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,n);
        System.out.println(result);
        in.close();
    }
}