#include <bits/stdc++.h>
using namespace std;

long odd_max(int k,int N,vector<int>& a,vector<long>& a_sum){
    int index = k/2;
    int left = k/2 + 1;
    int right = N  - k/2;
    int mid = a[index];
    long ans = a_sum[N] - a_sum[right] + a_sum[left] - (long)k * (long)mid;
    return ans;
}

long even_max(int k,int N,vector<int>& a,vector<long>& a_sum){
    int index1 = k/2 - 1;
    int index2 = k/2;
    int left = k/2 + 1;
    int right = N + 1 - k/2;
    int mid2 = a[index1] + a[index2];
    long ans = a_sum[N] - a_sum[right] + a_sum[left] - (long)k * (long)mid2 / 2;
    return ans;
}

int main(){
    int N;
    cin >> N;
    vector<int> a(N,0);
    vector<long> a_sum(N+1,0);
    for(int i=0;i<N;i++){
        cin >> a[i];
    }
    sort(a.begin(),a.end());
    for(int i=0;i<N;i++){
        a_sum[i+1] = a_sum[i] + a[i];
    }
    long max = 0;
    long temp;
    for(int i=1;i<=N;i++){
        if(i % 2 == 0){
            temp = even_max(i,N,a,a_sum);
            if(max <= temp){
                max = temp;
            }
        } else {
            temp = odd_max(i,N,a,a_sum);
            if(max <= temp){
                max = temp;
            }
        }
    }
    cout << max;
}