#include <bits/stdc++.h>

using namespace std;

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

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