#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int INFMEM = 63;
const int INF = 1061109567;
const long long LINF = 4557430888798830399LL;
const double DINF = numeric_limits<double>::infinity();
const int MOD = 1000000007;
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
inline void fastin(int &input_number) {
  input_number = 0;
  int ch = getchar_unlocked();
  int sign = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') sign = -1;
    ch = getchar_unlocked();
  }
  while (ch >= '0' && ch <= '9') {
    input_number = (input_number << 3) + (input_number << 1) + ch - '0';
    ch = getchar_unlocked();
  }
  input_number *= sign;
}
inline void open(string a) {
  freopen((a + ".in").c_str(), "r", stdin);
  freopen((a + ".out").c_str(), "w", stdout);
}
inline void fastios() { ios_base::sync_with_stdio(0); }
inline void fasterios() { cin.tie(0); }
priority_queue<long long, vector<long long>, greater<long long> > antri;
long long n, tmp, cnt, ans, now;
int main() {
  fasterios();
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> tmp;
    antri.push(tmp);
  }
  if (antri.size() % 2 == 0) {
    for (int i = 1; i <= 2; i++) ans += antri.top(), antri.pop();
    antri.push(ans);
  }
  while (antri.size() > 1) {
    now = 0;
    for (int i = 1; i <= 3; i++) now += antri.top(), antri.pop();
    ans += now;
    antri.push(now);
  }
  cout << ans << '\n';
  return 0;
}
