#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a)
{
 
    long l=0;
    long k=a.size();
    for(long i=0;i<k;i++)
    {
        if(a[i]==1)
        {
            l=l+1;
        }
        else if(a[i]%2!=0)
        {
            l=l+a[i]+1;
        }
        else
        {
            while(a[i]>0)
            {
                l=l+a[i];
                a[i]=a[i]/2;
            }
        }
    }
    return l;
}

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