Ilya is a very good-natured lion. He likes maths. Of all mathematical objects, his favourite one is matrices. Now he's faced a complicated matrix problem he needs to solve.

He's got a square 2ⁿ × 2ⁿ-sized matrix and 4ⁿ integers. You need to arrange all these numbers in the matrix (put each number in a single individual cell) so that the beauty of the resulting matrix with numbers is maximum.

The beauty of a 2ⁿ × 2ⁿ-sized matrix is an integer, obtained by the following algorithm:

1. Find the maximum element in the matrix. Let's denote it as m.
2. If n = 0, then the beauty of the matrix equals m. Otherwise, a matrix can be split into 4 non-intersecting 2^n - 1 × 2^n - 1-sized submatrices, then the beauty of the matrix equals the sum of number m and other four beauties of the described submatrices.

As you can see, the algorithm is recursive.

Help Ilya, solve the problem and print the resulting maximum beauty of the matrix.

The first line contains integer 4ⁿ(1 ≤ 4ⁿ ≤ 2·10⁶). The next line contains 4ⁿ integers a_i(1 ≤ a_i ≤ 10⁹) — the numbers you need to arrange in the 2ⁿ × 2ⁿ-sized matrix.

On a single line print the maximum value of the beauty of the described matrix.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.

Consider the second sample. You need to arrange the numbers in the matrix as follows:

1 2
3 4

Then the beauty of the matrix will equal: 4 + 1 + 2 + 3 + 4 = 14.

 #include <stdio.h>

 #include <math.h>

 #include <algorithm>

 using namespace std;

 int a[];

 bool cmp(int x,int y)

 {

     return x>y;

 }

 int main()

 {

     int n;

     int i,j;

     while(scanf("%d",&n)!=EOF)

     {

         for(i=;i<=n;i++)

         {

             scanf("%d",&a[i]);

         }

         sort(a+,a+n+,cmp);

         long long s=;

         for(i=;pow(,i)<=n+;i++)

         {

             for(j=;j<=pow(,i);j++)

                 s=s+a[j];

         }

         printf("%I64d\n",s);

     }

     return ;

 }