#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<unordered_map>
#include<random>
#include<array>
#include<cassert>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())



int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;
	vector<long long> y(n);
	rep(i, n)cin >> y[i];
	sort(all(y));

	if (y.front() == y.back()) {
		cout << 1 << endl;
		return 0;
	}

	vector<long long> s(n, 0);
	s[0] = y[0];
	rep(i, n - 1) {
		s[i + 1] = s[i] + y[i + 1];
	}



	long long ans = 1LL << 60;
	rep(i, n - 1) {
		int m1 = (0 + i) / 2;
		int m2 = (i + 1 + n - 1) / 2;

		auto a = s[i] - s[m1] - y[m1] * (i - m1) + y[m1] * (m1 + 1) - (s[m1]);
		auto b = s[n - 1] - s[m2] - y[m2] * (n - 1 - m2) + y[m2] * (m2 - i) - (s[m2] - s[i]);

		ans = min(ans, a + b);
	}
	cout << ans << endl;


	return 0;
}