#include <iostream>
#include <iomanip>
#include <cstring>
#include <algorithm> 
#include <math.h>
#include <queue>
#include <functional>
#include <map>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;

const ll INF = 1000000005;
ll n;
ll y[100005];
ll sum[100005];

int main(void){
    cin >> n;
 
    for (int i = 0; i < n; i++) cin >> y[i];
    sort(y, y + n);
    for (int i = 0; i < n; i++){
        sum[i] = y[i];
        if (i != 0) sum[i] += sum[i - 1];
    }

    ll ans = 1000000000000000;
    for (int i = 0; i < n; i++){
        ans = min(ans, y[i] * (2 * i + 2 - n) - 2 * sum[i] + sum[n - 1]);
    }

    cout << ans << endl;

}