#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
long long int f(int a)
{
    if(a==1)
        return 1;
    else if(a%2==0)
    { int k=0;
     int j=a;
       while(j!=1)
       {
           k+=j;
           j=j/2;
           
           
       }
     return k+1;
    }
    else return a+1;
   
}

int main() {  
    int n;
    cin >> n;
  
    long long int a[n];
    long long int s=0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        s+=f(a[i]);
    }
  
       cout<<s;
 
    return 0;
}