#include <bits/stdc++.h>

using namespace std;

typedef long long li;

int main() {
  int n;
  scanf("%d", &n);
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }  
  sort(a.begin(), a.end());
  li ans = 0;
  for (int i = 0; i < n; ++i) {
    ans += a[i] * (1ll << (n - 1 - i));
  }
  cout << ans << endl;
  return 0;
}