#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);
const long long INF = 1LL<<60;

int n;
int y[100000];
long long dp[100000+1];

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

  cin >> n;
  for (int i = 0; i < n; i++) cin >> y[i];
  sort(y, y+n);

  dp[n] = 0;
  for (int i = n-1; i >= 0; i--) {
    dp[i] = INF;
    if (i+2 <= n)
      dp[i] = min(dp[i], dp[i+2] + abs(y[i] - y[i+1]));
    if (i+3 <= n)
      dp[i] = min(dp[i], dp[i+3] + abs(y[i] - y[i+1]) + abs(y[i+1] - y[i+2]));
  }
  cout << dp[0] << endl;
  
  return 0;
}