#include<bits/stdc++.h>
using namespace std;
long long a[10005],b[10005],tot=1,pos_a=1,pos_b=1,n,f,ans;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	memset(b,127,sizeof(b));
	sort(a+1,a+n+1);
	for(int i=1;i<n;i++){
		f=0;
		if(a[pos_a]<b[pos_b])f+=a[pos_a++]; 
		else f+=b[pos_b++];
		if(a[pos_a]<b[pos_b])f+=a[pos_a++]; 
		else f+=b[pos_b++];
		b[tot++]=f;
		ans+=f;
	}
	cout<<ans;
	return 0;
}