#include<iostream>
#include<algorithm>
using namespace std;

int n ;
int t[100001] ;

void S( )
    {
    long long sum = 0 ;
    int m1 , m2 ;
    cin >> n ;
    cin >> t[0] ;
    cin >> t[1] ;
    if ( t[0] <= t[1] ) { m1 = t[0] ; m2 = t[1] ; }
    else { m1 = t[1] ; m2 = t[0] ; }
    sum = (t[0] * 2) + (t[1] * 2) ;
    for ( int i = 2 ; i < n ; i++ )
        {
        cin >> t[i] ;
        if ( t[i] < m1 )  { m2 = m1 ; m1 = t[i] ; }
        else if ( t[i] < m2 ) m2 = t[i] ;
        sum = sum + (t[i] * 2) ;
        }
    sum = sum - m1 ;
    sum = sum - m2 ;
    sort( t , t+n ) ;
    cout << sum << endl ;
    }

void E( )
    {
    for ( int i = 1 ; i < n ; i++ )
        cout << t[i] << " " ;
    cout << t[0] << endl ;
    }

int main()
{
    #ifdef ONLINE_JUDGE
    freopen("shuffle.in", "r", stdin);
    freopen("shuffle.out", "w", stdout);
    #endif

    S( ) ;

    E( ) ;
    return 0 ;
}