#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  vector<ll> Y(N);
  for (int i = 0; i < N; i++) {
    cin >> Y[i];
  }
  sort(Y.begin(), Y.end());
  if (N == 2) {
    cout << abs(Y[1] - Y[0]) << "\n";
    return 0;
  }
  if (N == 3) {
    cout << abs(Y[1] - Y[0]) + abs(Y[2] - Y[1]) << "\n";
    return 0;
  }
  ll dp[N + 1]{};
  dp[0] = pow(10, 15);
  dp[1] = abs(Y[1] - Y[0]);
  dp[2] = abs(Y[1] - Y[0]) + abs(Y[2] - Y[1]);
  for (int i = 3; i < N; i++) {
    ll c1 = abs(Y[i-1] - Y[i - 2]) + abs(Y[i] - Y[i - 1]);
    ll c2 = abs(Y[i - 1] - Y[i]);
    dp[i] = min(dp[i-3] + c1, dp[i-2] + c2);
  }
  cout << dp[N-1] << "\n";
  return 0;
}