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