#include<stdio.h>
#include<stdlib.h>

#define MIN(a,b) ((a)<(b)?(a):(b))

void msort(int *a,int n,int *merge){
  if(n<=16){
    int i,j;
    for(i=1;i<n;i++){
      int p=a[i];
      j=i-1;
      while(j>=0 && p<a[j]){
	a[j+1]=a[j];
	j--;
      }
      a[j+1]=p;
    }
    return;
  }

  int m=n/2;
  msort(a,m,merge);
  msort(a+m,n-m,merge);

  int i,j,k;
  i=0;
  j=m;
  k=0;
  while(i<m && j<n){
    if(a[i]<=a[j]){
      merge[k++]=a[i++];
    } else {
      merge[k++]=a[j++];
    }
  }
  while(i<m) merge[k++]=a[i++];
  while(j<n) merge[k++]=a[j++];

  for(i=0;i<n;i++) a[i]=merge[i];
  return;
}

int calc(int *array,int n,int shift){
  if(n<=1) return 0;
  if(shift==0) return (array[0]&0x01)!=(array[n-1]&0x01);
  if(((array[0]>>shift)&0x01) == ((array[n-1]>>shift)&0x01)) return calc(array,n,shift-1);

  int l=0;
  int r=n;
  while(l+1<r){
    int m=(l+r)/2;
    if((array[m]>>shift)&0x01){
      r=m;
    } else {
      l=m;
    }
  }
  return (1<<shift)+MIN(calc(array,r,shift-1),calc(array+r,n-r,shift-1));
}

void run(void){
  int n;
  scanf("%d",&n);
  int *array=(int *)malloc(sizeof(int)*n);
  int i;
  for(i=0;i<n;i++){
    scanf("%d",array+i);
  }
  int *merge=(int *)malloc(sizeof(int)*n);
  msort(array,n,merge);
  free(merge);
  int ans=calc(array,n,30);
  printf("%d\n",ans);
  return;
}

int main(void){
  run();
  return 0;
}