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 result=0;
        long Two39=549755813888L;
        for(int i=0;i<a.length;i++){
            long tempRes=0;
            int powTwo=0;
            long tempNum=a[i];
            while(tempNum%2==0){
                if(tempNum% Two39==0){
                    powTwo+=39;
                    tempNum=tempNum/Two39;
                }else if(tempNum% 4294967296L==0){
                    powTwo+=32;
                    tempNum=tempNum/549755813888L;
                }else if(tempNum% 16777216 ==0){
                    powTwo+=24;
                    tempNum=tempNum/16777216;
                }else if(tempNum% 32768  ==0){
                    powTwo+=15;
                    tempNum=tempNum/32768;
                }else if(tempNum% 512  ==0){
                    powTwo+=9;
                    tempNum=tempNum/512;
                }else if(tempNum% 16  ==0){
                    powTwo+=4;
                    tempNum=tempNum/16;
                }else{
                    powTwo+=1;
                    tempNum=tempNum/2;
                }
            }
            long temp = (long)Math.pow(2, powTwo+1)-1;
            //System.out.println(" A i "+a[i] +' '+powTwo+' '+temp+' '+tempNum);
            tempRes = tempNum*temp+1L;
            //System.out.println(tempRes);
            if(a[i]==1)
                tempRes=1;
            result+=tempRes;
        }
        return result;
    }

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