#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    unsigned int long long r=0;
    long dd;
   for(int i=0;i<a.size();i++){
       dd=1;
       if(a.at(i)%2==0){
           int b=a.at(i);
           while(b>1){dd=dd+b;b=b/2;}
       }
       else{if(a.at(i)!=1) dd=a.at(i)+1;}
       r=r+dd;
   }
    return r;
}

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