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

int N;
int64_t A[100000], S[100001];

// [l, r)
int64_t calc(int l, int r){
    int m = l + (r-l)/2;
    int64_t res = (m-l)*A[m];
    res -= S[m] - S[l];
    res += S[r] - S[m];
    res -= (r-m)*A[m];
    return res;
}

int main(){
    cin >> N;
    for(int i=0; i<N; i++) cin >> A[i];
    sort(A, A+N);
    if(A[0] == A[N-1]){
        cout << 1 << endl;
        return 0;
    }

    for(int i=0; i<N; i++) S[i+1] = A[i] + S[i];

    int64_t ans = 1e18;
    for(int i=1; i<N; i++){
        int64_t res = calc(0, i) + calc(i, N);
        ans = min(ans, res);
    }
    cout << ans << endl;
    return 0;
}