#include <bits/stdc++.h>

using namespace std;

long longestSequence(int a[],int n) {
    int s=0,h;
    for(int i=0;i<n;i++)
    {
        h=a[i];
        if(a[i]==1)
             s+=1;
        else if(a[i]%2!=0)
          s+=a[i]+1;
        
        else 
        {while(h>0)
        {
        if(h%2==0)
        {s+=h/2;
            h=h/2;
        }
         else
         {
             s+=h/2;
             h=h/2;
        }
        }
         s+=a[i];
    }
    }
    return s;
}
int main() {
    int n;
    cin >> n;
    int a[n];
    for(int i = 0; i < n; i++){
       cin >> a[i];
    }
    long result = longestSequence(a,n);
    cout << result << endl;
    return 0;
}