#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n;
int a[100010];

int calc(vector<int>& v, int b) {
    if (b < 0) return 0;
    int l = v.size();
    vector<int> p[2];
    for (int i = 0; i < l; i++) {
        if ((a[v[i]]>>b)&1) p[1].push_back(v[i]);
        else p[0].push_back(v[i]);
    }
    if (p[0].size() == 0) return calc(p[1], b-1);
    if (p[1].size() == 0) return calc(p[0], b-1);
    return (1<<b) + min(calc(p[0], b-1), calc(p[0], b-1));
}

int solve() {
    vector<int> v(n);
    int b = 0;
    for (int i = 0; i < n; i++) {
        v[i] = i;
        int k = 0;
        while ((a[i]>>k) > 0) k++;
        b = max(b, k-1);
    }

    return calc(v, b);
}

void input() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}