#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 30000000000000LL
#define GOLD 1.61803398874989484820458
const long long MAX_MOD = 1e6 + 3;
#define REP(i,n) for(long long i = 0;i < n;++i)    
#define seg_size 524288
long long powering(long long now,long long now_go){
	long long ans = 1;
	while (now_go != 0) {
		if (now_go % 2 == 1) {
			ans *= now;
			ans %= MAX_MOD;
		}
		now *= now;
		now %= MAX_MOD;
		now_go /= 2;
	}
	return ans;
}
long long inv(long long now) {
	return powering(now, MAX_MOD - 2LL);
}
long long ans[2][300000];
long long ruiseki[2][300000];
int main() {
#define int long long
	int n;
	cin >> n;
	if (n == 2) {
		cout << 0 << endl;
		return 0;
	}
	vector<int> input;
	REP(i, n) {
		int a;
		cin >> a;
		input.push_back(a);
	}
	sort(input.begin(), input.end());
	REP(tea, 2) {
		for (int q = 1; q <= n; ++q) {
			ruiseki[tea][q] += ruiseki[tea][q - 1];
			ruiseki[tea][q] += input[q - 1];
		}
		long long geko = 0;
		for (long long i = 0; i < n; ++i) {
			long long mid = i/2;
			geko = input[mid] * mid;
			geko -= ruiseki[tea][mid];
			ans[tea][i] += geko;
			geko = -(input[mid] * (i - mid));
			geko += ruiseki[tea][i+1] - ruiseki[tea][mid+1];
			ans[tea][i] += geko;
		}
		reverse(input.begin(), input.end());
	}
	long long answer = LONG_INF;
	for (long long i = 0; i < n-1; ++i) {
		answer = min(answer, ans[0][i] - ans[1][n - i - 2LL]);
	}
	int ok = 1;
	for (int i = 0; i < input.size()-1; ++i) {
		if (input[i] != input[i + 1]) ok = 0;
	}
	answer = max(answer, ok);
	cout << answer << endl;
	return 0;
}