#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using ull = unsigned long long;
long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}
long long mod = 1000000007;
int main() {
  long long N; cin >> N;
  vector<long long> A(N);
  for(int i = 0; i < N; i++) cin >> A[i];
  long long count = 0;
  sort(A.begin(),A.end());
  reverse(A.begin(),A.end());
  int z = 0;
  long long ans = 0;
  bool fire = false;
  while(true) {
    long long x = 1ll << count;
    for(int i = 0;i < x; i++) {
      ans += A[z] * count;
      z++;
      if(z >= N) {
        fire = true;
        break;
      }
    }
    if(fire) {
      break;
    }
    count++;
  }
  cout << ans << endl;
}