#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 4000005
#define inf 0x3f3f3f3f

int n,a[maxn],m;
vi e[maxn];
priority_queue<int>q[maxn];
int sum,delt;

void dfs(int u,int pa)
{
	for(int v:e[u]){
		if(v==pa)continue;
		dfs(v,u);
		if(q[u].size()<q[v].size())swap(q[u],q[v]);
		while(q[v].size())q[u].push(q[v].top()),q[v].pop();
	}
	int now=a[u];
	while(q[u].size() && now<q[u].top()){
		int x=q[u].top(); q[u].pop();
		if(!q[u].size()) {
			if(n&1^1) delt+=now-x;
			else delt+=x-now;
			return;
		}
		int y=q[u].top(); q[u].pop();
		now=now+y-x;
	}
	q[u].push(now);
}


signed main()
{
	m=read();
	n=1; a[1]=0;
	
	For(i,1,m){
		ll x;cin>>x;
		int lst=1;
		while(x>0){
			++n;
			a[n]=x&1,x>>=1;
			e[lst].pb(n),lst=n;
		}
	}
	
	dfs(1,0);
	
	for(int i=1;q[1].size();++i,q[1].pop())
		if(i&1)delt+=q[1].top();
		else delt-=q[1].top();
	For(i,1,n)sum+=a[i];
	//cout<<"sum,delt "<<sum<<" "<<delt<<endl;
	int res=(sum+delt)/2;
	cout<<-delt;
	return 0;
}
/*
1
0101
1011
01011
10111
*/