#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

long int longestSequence(int a_size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
    long int s[a_size],b,sm=0;
    for(int i=0;i<a_size;i++){
        b=a[i];
        if(a[i]==1) s[i]=1;
        else s[i]=a[i]+1;
        while(b%2==0){
            s[i]+=b/2;
            b=b/2;
            if(b==0) break;
            }
        
    }
    for(int i=0;i<a_size;i++)
        sm+=s[i];
    
    return (sm);
    
}

int main() {
    int n; 
    scanf("%i", &n);
    long int *a = malloc(sizeof(long int) * n);
    for (int a_i = 0; a_i < n; a_i++) {
       scanf("%li",&a[a_i]);
    }
    long int result = longestSequence(n, a);
    printf("%ld\n", result);
    return 0;
}