#include<stdio.h>
#include<Stdlib.h>
const int maxn=2001;
const int maxm=4000010;
struct aa
{
	int l,r;
	long long w;
}edge[maxm];
int a[maxn];
int f[maxn];
int n,m,num;
long long ans;
int cmp(const void*a,const void*b)
{
	if(((struct aa*)a)->w>((struct aa*)b)->w) return -1;
	else return 1;
}
int find(int x)
{
	if(f[x]==x) return x;
	else return f[x]=find(f[x]);
}
int main()
{
	freopen("superbull.in","r",stdin);
	freopen("superbull.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++)
	 for(int j=i+1;j<=n;j++)
	 {
		edge[++m].l=i;
		edge[m].r=j;
		edge[m].w=a[i]^a[j];
	 }
	qsort(edge+1,m,sizeof(edge[0]),cmp); 
	for(int i=1;i<=n;i++) f[i]=i;
	ans=0;
	num=0;
	for(int i=1;i<=m;i++)
	{
		int x=find(edge[i].l);
		int y=find(edge[i].r);
		if(x!=y)
		{
			f[x]=y;
			ans+=edge[i].w;
			num++;
		}
	} 
	printf("%lld",ans);
}