405112: GYM101798 G World Mug (B)

The organizers of the tournament wish to ensure a great amount of fun for the fans, for that, they have decided to rearrange the teams such that more goals in the tournament are scored.

Can you help out by calculating the maximum number of goals that could be scored if the teams were rearranged optimally?

The first line of input contains one integer n (2 ≤ n ≤ 2¹⁸), the number of teams participating in the tournament. It is guaranteed that the number of teams is a power of two (i.e., 2, 4, 8, 16, ...).

The second line contains n distinct integers, the i^th integer is s_i (1 ≤ s_i ≤ 10⁹), the strength of the i^th team.

On a single line, print the maximum number of goals that could be scored in the tournament if the teams were rearranged to maximize that number.

8
100 200 300 400 800 700 600 500

2100