Xor-MST

2000ms

262144K

Description:

You are given a complete undirected graph with n vertices. A number a_i is assigned to each vertex, and the weight of an edge between vertices i and j is equal to a_i xor a_j.

Calculate the weight of the minimum spanning tree in this graph.

Input:

The first line contains n (1 ≤ n ≤ 200000) — the number of vertices in the graph.

The second line contains n integers a₁, a₂, ..., a_n (0 ≤ a_i < 2³⁰) — the numbers assigned to the vertices.

Output:

Print one number — the weight of the minimum spanning tree in the graph.

Sample Input:

5
1 2 3 4 5

Sample Output:

Sample Input:

4
1 2 3 4

Sample Output:

Informação

Provedor Codeforces

Código CF888G