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

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