#include "bits/stdc++.h"

using namespace std;

using ll = long long int;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;

const int INF = (1 << 30) - 1;
const ll INF64 = ((ll)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

const int dx[] = { -1, 0, 1, 0 };
const int dy[] = { 0, 1, 0, -1 };

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

ll solve(ll n, vl y) {
	if (n == 1) {
		return 0;
	}

	ll k = 2;
	priority_queue<ll> pq;
	set<ll> se;
	for (int i = 0; i < n; i++) {
		if (se.count(y[i])) {
			continue;
		}
		pq.push(y[i]);
		se.insert(y[i]);

		if (pq.size() > k) {
			pq.pop();
		}
	}

	ll cww = pq.top();
	ll diffSum = 0;
	for (int i = 0; i < n; i++) {
		ll diff = abs(cww - y[i]);

		diffSum += diff;
	}

	return diffSum;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	ll n;
	cin >> n;

	vl y(n);
	for (int i = 0; i < n; i++) {
		cin >> y[i];
	}
	sort(y.begin(), y.end());

	cout << solve(n, y) << endl;
	return 0;
}