#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <functional>
#include <queue>
#include <string>
#include <cstring>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
using namespace std;

typedef long long ll;

#define INF 10e17
#define rep(i,n) for(long long i=0; i<n; i++)
#define repr(i,n,m) for(long long i=m; i<n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) for (auto&& itr : x) { debug(itr); }

template <class T> inline void chmax(T &ans, T t) { if (t > ans) ans = t;}
template <class T> inline void chmin(T &ans, T t) { if (t < ans) ans = t;}

ll dp[100010][2];

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

    int n;
    cin >> n;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];

    ll mi = 0;
    sorti(a);
    // roll(a);

    
    dp[0][0] = INF;
    dp[0][1] = abs(a[0] - a[1]);
    a.push_back(INF);


    // 0 hidari, 1 migi
    for (int i = 1; i < n; ++i) {
        // 右
        dp[i][1] = min(dp[i-1][0], dp[i-1][1]) + abs(a[i] - a[i+1]);
        // 左
        dp[i][0] = min(dp[i-1][0] + abs(a[i-1] - a[i]), dp[i-1][1]);
    }

    cout << min(dp[n-1][0], dp[n-1][1]) << endl;
}