#include <bits/stdc++.h>
using namespace std;

int n;
vector<long long> a;

int main() {
  cin >> n;
  a.resize(n);
  for (auto& p : a) cin >> p;
  sort(a.begin(), a.end(), greater<long long>());
  long long res = 0;
  for (int id = 0, i = 0; id < n; ++i) {
    for (int j = 0; j < (1 << i); ++j)
      if (id < n) res += a[id++] * i;
  }
  cout << res << endl;
  return 0;
}