#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    
    int sum=0;
    for(int i=0;i<a.size();i++)
    {
        
    if(a[i]%2==0)
    {
        while(a[i]>0)
        {
            sum+=a[i];
            a[i]/=2;
       
        }
    }  
     
    else if(a[i]%2!=0&&a[i]!=1)
         sum+=a[i]+1;
    
    else if(a[i]==1)
        sum+=1;
       
    }
        return sum;
}

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