#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N;
ll X[100100], Y[100100], Z[100100];

template <typename T, size_t n>
T at(T (&arr)[n], int idx){
    if(0 <= idx && idx < n){
        return arr[idx];
    }
    return 0;
}

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

    std::cin >> N;

    for(int i=0;i<N;++i){
        std::cin >> Y[i];
    }

    sort(Y, Y+N);
    copy(Y, Y+N, X);
    copy(Y, Y+N, Z);
    
    for(int i=0;i+1<N;++i){
        Y[i+1] += Y[i];
    }

    for(int i=N-1;i-1>=0;--i){
        Z[i-1] += Z[i];
    }

    ll res = -1;
    for(int i=0;i<N;++i){
        int n = i + 1, m = N - n;
        ll x = at(X, i) * n - at(Y, i) + at(Z, i+1) - at(X, i) * m;
        
        if(res == -1 || res > x){
            res = x;
        }
    }

    std::cout << res << std::endl;
}