#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long result=0;
    for(int b=0;b<a.size();b++){
        long num=a[b];
        while(num>1){
            result=result+num;
            if(num%2==0)
            num=num/2;
            else
               num=num%2; 
        }
        result=result+1;
        //printf("%ld \n",result);
    }
return result;
}

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