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

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