//以字典树为例
//N为字符串数量
int N = 10000 + 10;
int M = N * 26;
int son[M][26]; //第一维为编号 第二维下标代表当前位置的字母 son存储儿子的编号
int idx = 0;
int cnt[N]; //标记节点
void insert(string s) {
int p = 0;
for (int i = 0; i < s.size(); i++) {
int u = s[i] - 'a';
if(! son[p][u])
son[p][u] = ++idx;
p = son[p][u];
}
cnt[p]++;
}
define _CRT_SECURE_NO_WARNINGS 1;
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#define ll long long
#define off ios::sync_with_stdio(false);
#define INF 0x3f3f3f3f
const int N = 1e6 + 1;
using namespace std;
int son[3000000][2];//31表示二进制位, son记录下标
int a[100001];
int idx = 0;
void insert(int x) {
int p = 0;
for (int i = 30; ~i; i--) {
int &s = son[p][x >> i & 1];
if (!s) s = ++idx;
p = s;
}
}
int query(int x) {
int res = 0;
int p = 0;
for (int i = 30; ~i; i--) {
int s = x >> i & 1;
if (son[p][!s]) {
res += 1 << i;
p = son[p][!s];
}
else {
p = son[p][s];
}
}
return res;
}
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
insert(a[i]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(query(a[i]), ans);
}
cout << ans << endl;
return 0;
}