#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main(){
  long long int n, i, ans = 0;
  scanf("%lld", &n);
  long long int x, cn, pw;
  long long int arr[n];
  for(i = 0; i < n; i++){
    scanf("%lld", &arr[i]);
  }
  for(i = 0; i < n; i++){
    x = arr[i];
    cn = 1;
    pw = 1;
    while(x!=0){
      if(x==1){
        ans = ans + 1;
        break;
      }
      else if(x%2==1){
        ans = ans + pw*x + 1;
        //cout<<ans<<"&"<<x<<"  ";
        break;
      }
      else if(x%2==0){
        ans = ans + x/2;
        x = x/2;
        cn++;
        pw = pow(2,cn-1);
        //cout<<ans<<"%"<<x<<"  ";
      }
    }
  }
  //cout<<endl;
  printf("%lld", ans);
  return 0; 
}