#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>

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;

vector<ll> y, sum;

ll len(ll s, ll e) {
	ll m = (s + e) / 2;
	ll cnt = e - s + 1;
	ll res = 0;
	if (cnt & 1) {
		res += sum[e + 1] - sum[m + 1];
		res -= sum[m] - sum[s];
	}
	else {
		res += sum[e + 1] - sum[m + 1];
		res -= sum[m] - sum[s];
		res -= y[m];
	}
	return res;
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	ll N; scanf("%lld", &N);
	y.resize(N); for (ll i = 0; i < N; i++) scanf("%lld", &y[i]);
	sort(y.begin(), y.end());
	if (y[0] == y.back()) puts("1");
	else {
		sum.resize(N + 1); for (ll i = 0; i < N; i++) sum[i + 1] = sum[i] + y[i];
		ll res = INF;
		for (ll i = 1; i < N; i++) {
			//cout << i << " " << len(0, i - 1) << " " << len(i, N - 1) << endl;
			chmin(res, len(0, i - 1) + len(i, N - 1));
		}
		cout << res << endl;
	}
	return 0;
}