#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 moves = 0; 
    int i, temp;
    for(i=0;i<a_size;i++)
    {
        temp = a[i];
        if(a[i]%2 == 0)
        {
            while(temp)
            {
                moves = moves + temp;
                temp = temp/2;
            }
        }
        else if(a[i] != 1 )
        {
            moves = moves + a[i] + 1;
        }
        else
            moves = moves + a[i];

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