#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 n, long int* a) {
   int i;long int b[n],s=0;
    for(i=0;i<n;i++){
        if(a[i]%2!=0)
        { if(a[i]!=1)
            b[i]=a[i]+1;
         else b[i]=1;
        } int t=0;
      if(a[i]%2==0){  long int w=a[i],h=1,m;
        while(w%2==0){
            w=w/2;h=h*2;
        } m=a[i]/h; a[i]=h;
        b[i]=0;
            while(a[i]%2==0){
               a[i]=a[i]/2;
                b[i]=b[i]+pow(2,t); ++t;}
                b[i]=b[i]+pow(2,t);    b[i]=b[i]*m+1;}
                    
    s=s+b[i];} return s;
}

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