#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

ll N;
ll a[200500];
ll sum[200500];
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	scanf("%lld", &N);
	for (ll i = 0; i < N; i++) scanf("%lld", &a[i]);
	sort(a, a + N);
	if (a[0] == a[N - 1]) {
		puts("1");
		return 0;
	}
	for (ll i = 0; i < N; i++) sum[i + 1] = sum[i] + a[i];
	ll res = INF;
	for (ll i = 0; i < N - 1; i++) {
		ll lcnt = i + 1;
		ll rcnt = N - lcnt;
		ll tmp = 0;
		ll lc = lcnt / 2;
		ll rc = i + 1 + rcnt / 2;
		tmp += a[lc] * (lc + 1) - sum[lc + 1] + sum[lcnt] - sum[lc + 1] - a[lc] * (lcnt - lc - 1);
		tmp += a[rc] * (rc - i) - (sum[rc + 1] - sum[lcnt]) + sum[N] - sum[rc + 1] - a[rc] * (N - rc - 1);
		chmin(res, tmp);
	}
	cout << res << endl;
	return 0;
}