#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>


using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>


ll n, ans;
int main() {
	cin >> n;
	vector<ll> s(n + 2);
	s[0] = MINF;
	REPO(i, n)cin >> s[i];
	s[n + 1] = INF;
	sort(ALL(s));
	REPO(i, n) {
		if (s[i - 1] != s[i] and s[i + 1] != s[i]) {
			if (abs(s[i - 1] - s[i]) < abs(s[i + 1] - s[i])) {
				ans += abs(s[i - 1] - s[i]);
				s[i] = s[i - 1];
			}
			else {
				ans += abs(s[i + 1] - s[i]);
				s[i] = s[i + 1];
			}
		}
	}
	cout << ans << endl;
}