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

int findCount(unsigned long long int a)
{
    unsigned long long int temp=a;
    int count=0;
    while(temp>2 && temp%2==0)
    {
        temp=temp/2;
        count++;
    }
    unsigned long long int sum=a/pow(2,count),fact=sum;
    //cout<<"sum"<<sum<<endl;
    for(int i=0;i<count;i++)
    {
        fact*=2;
       sum=sum+fact; 
    }
    //cout<<sum<<endl;
    return sum+1;
}
int main() {  
    int n;
    cin >> n;
    int sum=0;
    unsigned long long int arr[n];
    
    for(int i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    
    for(int i=0;i<n;i++)
    {
        if(arr[i]==1)
            sum+=1;
        else if(arr[i]%2!=0)
            sum+=arr[i]+1;
        else
            sum+=findCount(arr[i]);
        
       // cout<<"sum "<<sum<<endl;
    }
    cout<<sum<<endl;
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}