import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    def dfs(l, r, d=31):
        if r - l == 1: return 0
        for i, a in enumerate(aa[l:r], l):
            if a >> d & 1:
                m = i
                break
        else:
            m = l
        if m == l:
            return dfs(l, r, d - 1)
        return (1 << d) + min(dfs(l, m, d - 1), dfs(m, r, d - 1))

    n = II()
    aa = list(set(LI()))
    aa.sort()
    print(dfs(0, len(aa)))

main()