#include <bits/stdc++.h>

using namespace std;
int used = 0;
int calcMoves(long num){
    
 //   cout<<num<<" ";
    if(num==1) return 1;
    if(num == 2) return 3;
    if(num%2!=0){
        return num+1;
    }
    else{
        int mid = num/2;
        if(mid%2!=0){
            return 1+  mid * calcMoves(2);
        }
        else{
            return 1+calcMoves(mid);
        }
    }
    
   // return ans;
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    
    int n = a.size(),ans=0;
    for(int i =0 ;i<n;i++){
        ans += calcMoves(a[i]);
        used = 0;
    }
    return ans;
}

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