#include <bits/stdc++.h>
#define ll long long
#define Ma 1000005 
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(x) x.begin(),x.end()
#define N 40

using namespace std;


ll n;
ll a[Ma];

ll ans=0;


void sol()
{
	ll n;
	cin>>n;
	vector <ll> v;
	for (ll i=1;i<=n;i++){
		ll x;
		cin>>x;
		v.pb(x);
	}
	sort(all(v));
	ll ans=n;
	for (ll k=N-1;k>=0;k--){
		vector <ll> l,r;
		for (auto z:v)
		{
			if (z>>k&1)
				l.pb(z-(1ll<<k));
			else
				r.pb(z);
		}
		vector <ll> ne;
		ll le=0,re=0;
		if (l.size()&&r.size())
			ans+=v.size();
		while (le<l.size()||re<r.size())
		{
			if (le<l.size()&&(re==r.size()||l[le]<r[re]))
			{
				if (ne.size()&&l[le]==ne.back())
					ans-=2,le++;
				else
					ne.pb(l[le++]);
			}
			else
			{
				if (ne.size()&&r[re]==ne.back())
					ans-=2,re++;
				else
					ne.pb(r[re++]);
			}
		}
		swap(v,ne);
		//printf("k=%lld ans=%lld\n",k,ans);
		
	}
	printf("%lld\n",ans);
}



int main()
{
	IOS
	ll tt=1;
	//cin>>tt;
	while (tt--)
		sol();
	return 0;
}