#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxN = 1E5+10;
int N,s,nums[maxN],sn,sm;
queue <int> nz,mz;
inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9')
        x=x*10+ch-'0',ch=getchar();
    return x*f;
}
void write(int x)
{
    if(x<0)
        putchar('-'),x=-x;
    if(x>9)
        write(x/10);
    putchar(x%10+'0');
    return;
}
signed main(){
	N = read();
	for(int i = 1; i <= N; ++ i){
		s = read();
		++ nums[s];
	}for(int i = 1; i <= maxN-10; ++ i){
		for(s = nums[i]; s; -- s)nz.push(i);
	}s = 0;for(int i = 1; i < N; ++ i){
		if((nz.size() && nz.front()>mz.front()) or mz.size()<1){
			sn = nz.front();nz.pop();
//			sm = nz.front();nz.pop();
		}else{
			sn = mz.front();mz.pop();
//			sm = mz.front();mz.pop();
		}if((nz.size() && nz.front()>mz.front()) or mz.size()<1){
//			sn = nz.front();nz.pop();
			sm = nz.front();nz.pop();
		}else{
//			sn = mz.front();mz.pop();
			sm = mz.front();mz.pop();
		}
		s+=sn+sm;
		mz.push(sn+sm);
	}
	write(s);
	
	return 0;
}