#include "bits/stdc++.h"

using namespace std;

void solve(void)
{
	int n;
	cin >> n;
	vector<long> ys(n), dp(n+1, 1e15);
	dp[0] = 0;
	for (int i = 0; i < n; i++)
	{
		cin >> ys[i];
	}
	sort(ys.begin(), ys.end());
	for (int i = 0; i < n; i++)
	{
		for (int j = 2; j <= 3 && i + j <= n; j++)
		{
			long plus = 0;
			for (int k = 0; k < j; k++)
			{
				plus += abs(ys[i + k] - ys[i + j / 2]);
			}
			dp[i + j] = min(dp[i + j], dp[i] + plus);
		}
	}
	cout << dp.back() << endl;
}

int main()
{
	solve();
	//cout << "yui(*-v・)yui" << endl;
	return 0;
}