Dr. Evil Underscores

题目

Today, as a friendship gift, Bakry gave Badawy n integers a1,a2,…,an and challenged him to choose an integer X such that the value max1≤i≤n(ai⊕X) is minimum possible, where ⊕ denotes the bitwise XOR operation.

As always, Badawy is too lazy, so you decided to help him and find the minimum possible value of max1≤i≤n(ai⊕X).

Input

The first line contains integer n (1≤n≤10^5).

The second line contains n integers a1,a2,…,an (0≤ai≤2^30−1).

Output

Print one integer — the minimum possible value of ${\max }_{1\le i\le n}\left(a_i\oplus x\right)$<