#include <bits/stdc++.h>

using namespace std;
int n;
long longestSequence(long a[]) {
    //  Return the length of the longest possible sequence of moves.
    long s=0,n1,d,x;
    for(int i=0;i<n;i++)
    {
        if(a[i]%2==0)
        {
        x=log(a[i])/log(2);
        d=pow(2,x);
        n1=d-1;
            s=s+((2*a[i]*n1)/d)+1;
        }
        else if(a[i]!=1)
            s=s+a[i]+1;
        else
            s=s+1;
    }
    return s;
}

int main() {
 
    cin >> n;
    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;
}