#include<bits/stdc++.h>
using namespace std;

#define int long long

const int N=5e4+1e3+7;

int n,a[N];

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n;
    int ans=0,sum=0;
    priority_queue<vector<int> > q;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        vector<int> v;
        int e=__lg(a[i]);
        for(int j=e;j>=0;j--)
        {
            int u=(a[i]>>j&1);
            v.push_back(u);
            while(1)
            {
                int m=v.size();
                if(m>=3&&v[m-3]<=v[m-2]&&v[m-2]>=v[m-1])
                {
                    int w=v[m-3]+v[m-1]-v[m-2];
                    v.pop_back();
                    v.pop_back();
                    v.pop_back();
                    v.push_back(w);
                }
                else
                    break;
            }
        }
        int m=v.size();
        int d=0;
        while(d+1<m&&v[d+1]<=v[d])
            sum+=v[d+1]-v[d],d+=2;
        // d ~ m - 1
        vector<int> z;
        for(int i=m-1;i>=d;i--)
            z.push_back(v[i]);
        if(z.size())
            q.push(z);
    }
    int op=0;
    while(q.size())
    {
        auto v=q.top();
        q.pop();
        if(!op)
            ans+=v.front();
        else
            ans-=v.front();
        op^=1;
        v.erase(v.begin());
        if(v.size())
            q.push(v);
    }
    if(!op)
        ans+=sum;
    else
        ans-=sum;
    cout<<ans<<"\n";
}