#include<cstdio>
#include<deque>
#include<iostream>
using namespace std;
long long n,p[2010],ans=0;
class miku
{
public:
	int id;
	int lo;
};
deque<miku> fuck[2010];
bool d[2010]={0};
int prim()
{
	deque<int> q;
	int k=0;
	q.push_back(1);
	d[1]=1;
	while(k<n)
	{
		
		int to=0,now=0;
		for(int i=0;i<q.size();i++)
		{
			//cout<<1;
			int t=fuck[i].size();
			while(t>0)
			{
				miku x=fuck[i].front();
				fuck[i].pop_front();
				if(d[x.id]==0)
				{
					if(x.lo>now)
					{
						now=x.lo;
						to=x.id;
					}
					fuck[i].push_back(x);
				}
				t--;
			}
		}
		ans+=now;
		q.push_back(to);
		d[to]=1;
		k++;
	}
	return 0;
}
int main()
{
	freopen("superbull.in","r",stdin);
	freopen("superbull.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	scanf("%d",&p[i]);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			miku x;
			x.id=j;
			x.lo=p[i]^p[j];
		    fuck[i].push_back(x);
		}
	prim();
	cout<<ans;
	return 0;
}