#include<stdio.h>

 #include<iostream>

 #include<queue>

 using namespace std;

 typedef long long ll;

 int n;

 int main()

 {

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

     {

         priority_queue<ll,vector<ll>,greater<ll> >q;

         ll ans = ;

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

         {

             int tmp;

             scanf("%d", &tmp);

             q.push(tmp);

         }

         if ((n & ) == )  q.push();  //n为偶数，补充一个0

         while (q.size() > )

         {

             ll a = q.top(); q.pop();

             ll b = q.top(); q.pop();

             ll c = q.top(); q.pop();

             ans += (a + b + c);

             q.push(a + b + c);

         }

         q.pop();

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

     }

 }