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 ans = 0;
       for(int i=0; i<a.length; i++ )
           ans = ans + sequence(a[i]);
        return ans;
    }
    
    static long sequence(long a){
        if( a ==1)
            return a;
        else
         if(a % 2 !=0)
            return (a + 1);
        else
         return sequence(a/2) + a;
    }

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