#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> arr) {
    long count=0;
    
    for(int i=0;i<arr.size();i++)
    {
        if(arr[i]%2==1)
        {
            count+=arr[i]+1;
            continue;
        }
        else if(arr[i]%2==0)
        {
            count+=count+arr[i];
             long flag=arr[i]/2;
            while(1)
            {
                if(flag%2==0)
                    count+=flag;
                else if(flag%2==1)
                {
                    count+=flag+1;
                    break;
                }
                flag/=2;
            }
        }
    }
    return count;
}

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