#include <iostream>

 #include <stdio.h>

 #include <string.h>

 #include <queue>

 using namespace std;

 int n;

 long long ans=;

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

 int get_top()

 {

     int now=q.top();

     q.pop();

     return now;

 }

 int main()

 {

     cin>>n;

     int a;

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

     {

         cin>>a;

         q.push(a);

     }

     while(q.size()>)

     {

         int v1=get_top();

         int v2=get_top();

         ans+=v1+v2;

         q.push(v1+v2);

     }

     cout<<ans<<endl;

 }