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

long long Steps(int n)
{
    long long a,b,c=0;
    if(n==1)
    {
        
        return c;
    }
    
    if(n%2==0)
    {
        n=n/2;
        c=c+2*Steps(n)+2;
        return c;
    }
    else
    {
        a=n/2;
        b=n-a;
        c=c+Steps(a)+Steps(b)+2;
        return c;
    }
}
int main() {  
    int n,i;
    long long sum=0;
    cin >> n;
    long long *arr=new long long[n];
    for(i=0;i<n;i++)
    {
        cin>>arr[i];   
    }
    for(i=0;i<n;i++)   
    {
        if(arr[i]%2==0)
        {
            sum+=Steps(arr[i]);
        }
        else
        {
            sum+=(Steps(arr[i])-arr[i]/2);
        }
    }
    cout<<sum;
    return 0;
}