#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int maxn = 1e5 + 1;
ll n, a[maxn], b[maxn];
ll maxsum = 0;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ifstream in("shuffle.in");
    ofstream out("shuffle.out");
    in >> n;
    for(int i = 0;i < n;i++){
        in >> a[i];
    }
    sort(a, a + n);
    b[0] = a[0];
    b[n - 1] = a[1];
    int pos = 1;
    for(int i = n - 1;i >= 2;i--){
        b[pos++] = a[i];
    }
    maxsum = b[0] + b[n - 1];
    for(int i = 1;i < n - 1;i++){
        maxsum = maxsum + 2 * b[i];
    }
    out << maxsum << endl;
    out << b[0];
    for(int i = 1;i < n;i++){
        out << " " << b[i];
    }
    out << endl;
    return 0;
}