#include <bits/stdc++.h>

int main()
{
	int N;
	scanf("%d", &N);
	std::vector<int64_t> Y(N);
	for (auto& e: Y) scanf("%lld", &e);
	std::sort(Y.begin(), Y.end());

	if (Y.front() == Y.back())
	{
		puts("1");
		return 0;
	}
	std::vector<int64_t> Y_sum(Y);
	for (int i{1}; i < N; i++) Y_sum[i] += Y_sum[i - 1];

	// right]
	int64_t min{1ll << 60};
	for (int right{}; right < N - 1; right++)
	{
		int64_t sum{};
		int mid1{(right + 1) / 2}, mid2{(N - (right + 1)) / 2 + right + 1};
		sum += (mid1 + 1) * Y[mid1] - Y_sum[mid1] + (Y_sum[right] - Y_sum[mid1]) - (right - mid1) * Y[mid1];
		sum += (mid2 - right) * Y[mid2] - (Y_sum[mid2] - Y_sum[right]) + (Y_sum[N - 1] - Y_sum[mid2]) - (N - 1 - mid2) * Y[mid2];
		min = std::min(min, sum);
	}
	printf("%lld\n", min);

	return 0;
}