#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) {
    int i,count=0;
    for(i=0;i<a_size;i++)
    {
        if(a[i]==1)
            count=count+1;
        else if(a[i]%2!=0)
            count=count+1+a[i];
        else
        {
            count=count+a[i];
            while(a[i]>1)
            {
                if(a[i]%2==0)
                {
                    count=count+a[i];
                    break;
                }
                else
                {
                    count=count+a[i]/2;
                    a[i]=a[i]/2;
                }
            }
        }
        }
        return count-2;
    //  Return the length of the longest possible sequence of moves.
}

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