#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
using namespace std;
using ll = long long;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<ll> a(n);
  map<ll, int> mp;
  rep(i, n) cin >> a[i], mp[a[i]]++;
  vector<pair<ll, int>> b;
  for (auto e : mp) {
    if (e.second >= 3) {
      b.emplace_back(e.first, 1);
      b.emplace_back(e.first, e.second - 2);
      b.emplace_back(e.first, 1);
    } else if (e.second == 2) {
      b.emplace_back(e.first, 1);
      b.emplace_back(e.first, 1);
    } else {
      b.emplace_back(e.first, 1);
    }
  }
  vector<ll> dp(b.size() + 1, 1e18);
  dp[0] = 0;
  for (int i = 0; i < b.size(); i++) {
    int cnt = 0;
    for (int j = i + 1; j <= min<int>(b.size(), i + 10); j++) {
      cnt += b[j - 1].second;
      int m = 0;
      int mid = 0;
      for (int k = i; k < j; k++) {
        m += b[k].second;
        if (m * 2 >= cnt) {
          mid = k;
          break;
        }
      }
      ll cost = 0;
      for (int k = i; k < j; k++) {
        cost += abs(b[mid].first - b[k].first) * b[k].second;
      }
      if (cnt >= 2) {
        dp[j] = min(dp[j], dp[i] + cost);
      }
    }
  }
  cout << dp[b.size()] << endl;
}