#include<bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

ll dfs(vector<ll> A, ll bit){
    if(bit<0){
        return 0;
    }

    vector<ll> B; // bit : 0
    vector<ll> C; // bit : 1

    for(ll a : A){
        if((a>>bit) & 1){
            C.push_back(a);
        }else{
            B.push_back(a);
        }
    }
    
    // if(B.size()==0 || C.size()==0){
    //     return dfs(A, b-1);
    // }
    // 全部1 -> xは0にすればいい
    if(B.size()==0){
        return dfs(C, bit-1);
    }
    else if(C.size()==0){
        return dfs(B, bit-1);
    }
    else{
        // bit = 1にしたとき
        ll mi0 = dfs(B, bit-1) + (1LL<<bit);
        ll mi1 = dfs(C, bit-1) + (1LL<<bit);
        return min(mi0, mi1);
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin >> N;

    vector<ll> A(N);
    FOR(i, 0, N){
        cin >> A.at(i);
    }

    ll ans = dfs(A, 30);
    p(ans);

    return 0;
}