#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; ++i)  cin >> a[i];
    sort(begin(a), end(a));
    vector<ll> sum(n + 1);
    for(int i = 0; i < n; ++i)  sum[i + 1] = sum[i] + a[i];

    ll ans = 0;
    for(int i = 1; i < n - 1; ++i){
        int lb = 0, ub = min(i, n - (i + 1)) + 1;
        while(ub - lb > 1){
            int mid = (lb + ub) / 2;
            if(a[i] - a[i - mid] < a[n - mid] - a[i])   lb = mid;
            else    ub = mid;
        }
        chmax(ans, sum[n] - sum[n - lb] + sum[i] - sum[i - lb] - 2LL * a[i] * lb);
    }

    cout << ans << endl;

    return 0;
}