#include "bits/stdc++.h"

using namespace std;

void solve(void)
{
	int n;
	cin >> n;
	set<long> s;
	vector<long> ys(n), acc(n + 1);
	for (int i = 0; i < n; i++)
	{
		cin >> ys[i];
		s.insert(ys[i]);
	}
	if (s.size() == 1)
	{
		cout << 1 << endl;
		return;
	}
	sort(ys.begin(), ys.end());
	for (int i = 0; i < n; i++)
	{
		acc[i + 1] = acc[i] + ys[i];
	}
	long ans = LONG_MAX;
	for (int l = 0; l < n; l++)
	{
		int ml = l / 2, mr = (n+l)/2;
		long sl = ys[ml] * ml - acc[ml] + (acc[l] - acc[ml]) - ys[ml] * (l - ml);
		long sr = ys[mr] * (mr - l) - (acc[mr] - acc[l]) + (acc[n] - acc[mr]) - ys[mr] * (n - mr);
		//cout << ml << ' ' << sl << ' ' << mr << ' ' << sr << endl;
		ans = min(ans, sl + sr);
	}
	cout << ans << endl;
}

int main()
{
	solve();
	//cout << "yui(*-v・)yui" << endl;
	return 0;
}