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

 class Solution {

    static long find(long n)
    {
        long sol=0;
        if(n%2==0)
        {
            sol+=n;
            return sol+find(n/2);
        }
        else if(n>2 && n%2!=0){
            sol+=n+1;
        }
        else sol+=1;
        return sol;
    }
    
    static long longestSequence(long[] a) {
        long sol=0;
        for(int i=0;i<a.length;i++)
        {
            sol+=find(a[i]);
        }
        return sol;
    }

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