# include <bits/stdc++.h> using namespace std ; long long a [20005] , b [20005] , t [20005] ; int main ( ) { long long n , sum = 0 , ans = 0 ; cin >> n ; memset ( a , 127 , 20005 ) ; memset ( b , 127 , 20005 ) ; for ( int i = 1 ; i <= n ; i ++ ) { cin >> a [i] ; } sort ( a + 1 , a + n + 1 ) ; long long k1 = 1 , k2 = 1 , k = 0 ; for ( int i = 1 ; i < n ; i ++ ) { if ( a [k1] < b [k2] ) { sum = a [k1 ++] ; } else { sum = b [k2 ++] ; } if ( a [k1] < b [k2] ) { sum += a [k1 ++] ; } else { sum += b [k2 ++] ; } b [++ k] = sum ; ans += sum ; } cout << ans << endl ; return 0 ; }