#include <bits/stdc++.h>


using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 1 << 29;
const ll INFL = 1LL << 60;
const ll mod = 1000000007;





int main() {
	
	int n;
	cin >> n;
	VLL y(n);
	REP(i, n)cin >> y[i];

	sort(ALL(y));
	ll a = y[0];
	REP(i, n) {
		y[i] -= a;
	}
	ll b = y[n / 4];
	ll c = y[(n * 3) / 4];

	ll ans = INFL;
	FOR(j,-5 ,5)FOR(k,-5, 5) {
		ll cur = 0;
		ll bb = n / 4;
		ll cc = (n * 3) / 4;
		bb += j;
		cc += k;
		if (bb < 0 || n <= bb || cc < 0 || n <= cc)continue;
		b = y[bb];
		c = y[cc];
		REP(i, n) {
			cur += min(abs(b - y[i]), abs(c - y[i]));
		}
		ans = min(ans, cur);
	}
	bool d = true;
	REP(i, n - 1) {
		if (y[i] != y[i + 1]) {
			d = false;
			break;
		}
	}
	if (d) {
		cout << 1 << endl;
		return 0;
	}

	cout << ans << endl;



}