#include<iostream>
#include<string.h>
#include<map>
#include<cstdio>
#include<cstring>
#include<stdio.h>
#include<cmath>
#include<math.h>
#include<algorithm>
#include<set>
#include<queue>
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
const int maxn=2e4+10;
const int maxk=1e4+10;
const int maxx=1e4+10;
const ll maxe=1000+10;
#define INF 0x3f3f3f3f3f3f
#define Lson l,mid,rt<<1
#define Rson mid+1,r,rt<<1|1
int n;
int a[maxn];
void solve()
{ll ans=0;while(n>1){int mi1=0,mi2=1;if(a[mi1]>a[mi2]) swap(mi1,mi2);for(int i=2;i<n;i++){if(a[i]<a[mi1]){mi2=mi1;mi1=i;}else if(a[i]<a[mi2]){mi2=i;}}int l=a[mi1]+a[mi2];ans+=l;if(a[mi1]==n-1) swap(mi1,mi2);a[mi1]=l;a[mi2]=a[n-1];n--;}cout<<ans<<endl;
}
int main()
{cin>>n;for(int i=0;i<n;i++){cin>>a[i];}sort(a,a+n);solve();return 0;
}

#include<iostream>
#include<string.h>
#include<map>
#include<cstdio>
#include<cstring>
#include<stdio.h>
#include<cmath>
#include<math.h>
#include<algorithm>
#include<set>
#include<queue>
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
const int maxn=2e4+10;
const int maxk=1e4+10;
const int maxx=1e4+10;
const ll maxe=1000+10;
#define INF 0x3f3f3f3f3f3f
#define Lson l,mid,rt<<1
#define Rson mid+1,r,rt<<1|1
int n;
int a[maxn];
priority_queue<int,vector<int>,greater<int> >que;//声明一个从小到大取出数值的优先队列
void solve()
{ll ans=0;for(int i=0;i<n;i++)que.push(a[i]);//全部存入队列while(n>1){int l1,l2;l1=que.top();que.pop();l2=que.top();que.pop();int t=l1+l2;ans+=t;que.push(t);n--;}cout<<ans<<endl;
}
int main()
{cin>>n;for(int i=0;i<n;i++){cin>>a[i];}// sort(a,a+n);
    solve();return 0;
}