#include<iostream>
#include<cstdio>
#include<set>
#include<queue>
using namespace std;
int n,x,b,c,ans=0,ansa=0;
priority_queue<int,vector<int>,greater<int> >a;
int main()
{
  freopen("fruit.in","r",stdin);
  freopen("fruit.out","w",stdout);
  scanf("%d",&n);
  for(int i=0;i<n;i++)
  {
    scanf("%d",&x);
	a.push(x);
  }
  for(int i=1;;i++)
  {
    b=a.top();a.pop();
    ansa=b+a.top();a.pop();
    ans+=ansa;
    if(a.empty())break;
    a.push(ansa);
  }
  printf("%d",ans);
  return 0;
}