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

public class Solution {

    static long longestSequence(long[] a) {
       long res = 0;
        long count = 0;
       for(int i=0;i<a.length;i++){
          if(a[i]==1){
              res+=1;
              continue;
          }
          if(a[i]%2!=0){
              res += a[i] + 1; 
              continue;
          }
          else{
              while(a[i]%2 == 0){
                  count += a[i];
                  a[i] = a[i]/2;
              }
              res += count + 1 + a[i];
              continue;
          }
       }
        
        return res;
    }

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