A1054 | Superbull--Silver

Bessie and her friends are playing hoofball in the annual Superbull
championship, and Farmer John is in charge of making the tournament as
exciting as possible. A total of N (1 <= N <= 2000) teams are playing in the
Superbull. Each team is assigned a distinct integer team ID in the range
1...2^30-1 to distinguish it from the other teams. The Superbull is an
elimination tournament -- after every game, Farmer John chooses which team to
eliminate from the Superbull, and the eliminated team can no longer play in
any more games. The Superbull ends when only one team remains.
Farmer John notices a very unusual property about the scores in matches! In
any game, the combined score of the two teams always ends up being the bitwise
exclusive OR (XOR) of the two team IDs. For example, if teams 12 and 20 were
to play, then 24 points would be scored in that game, since 01100 XOR 10100 =
11000.
Farmer John believes that the more points are scored in a game, the more
exciting the game is. Because of this, he wants to choose a series of games to
be played such that the total number of points scored in the Superbull is
maximized. Please help Farmer John organize the matches.

The first line contains the single integer N. The following N lines contain
the N team IDs.

Output the maximum possible number of points that can be scored in the
Superbull.