#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxN = 2e5+5;

ll N;
ll A[maxN];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin >> N;
    for(int i=1;i<=N;i++)
        cin >> A[i];
    sort(A+1,A+1+N);

    ll i=1,j=N;
    ll ans = 0;
    while(i<=j)
    {
        ans += A[i];
        i++;

        if(i>j) break;

        ans = ans + A[j];
        j--;
    }

    cout << ans << endl;

    return 0;
}