#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    long mv=0;
    for(int i=0;i<a.size();i++)
    {
       if(a[i]==1)
           mv++;
        else if((a[i]%2) !=0)
        {
           mv += a[i]+1;            
        }
        else
        {
            long temp=a[i]; 
            while(a[i] > 1)
            {
              a[i]=a[i]/2; //size of each part 2
              mv += a[i];              
            }
            
            mv+= temp;
        }
    }
    
    return mv;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}