#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>y(n), sy(n + 1);
	rep(i, n)cin >> y[i];
	sort(all(y));
	if (y.front() == y.back()) {
		cout << 1 << endl;
		return 0;
	}
	rep(i, n)sy[i + 1] = sy[i] + y[i];
	long long ans = LINF;
	rep2(i, 1, n) {
		int l = i;
		int r = n - i;
		long long sub = 0;
		{
			long long m = l / 2;
			long long c = y[m];
			//[0,m)[m,l)
			sub += m * c - (sy[m] - sy[0]);
			sub += (sy[l] - sy[m]) - c * (l - m);
		}
		{
			long long m = l + r / 2;
			long long c = y[m];
			//[l,m)[m,n)
			sub += (m - l) * c - (sy[m] - sy[l]);
			sub += (sy[n] - sy[m]) - c * (n - m);
		}
		chmin(ans, sub);
	}
	cout << ans << endl;
	return 0;
}