// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

int64 dp[100010];
int main() {
    int64 N; cin >> N;
    vector<int64> Y(N);
    for(int i=0; i<N; i++) cin >> Y[i];
    sort(Y.begin(), Y.end());

    fill(dp, dp + N + 1, INF);
    dp[0] = 0;
    for(int i=0; i<N; i++) {
        // 2 個 or 3 個
        if(i + 2 <= N) {
            int64 cost = abs(Y[i+1] - Y[i]);
            chmin(dp[i+2], dp[i] + cost);
        }

        if(i + 3 <= N) {
            int64 cost = abs(Y[i+1] - Y[i]) + abs(Y[i+1] - Y[i+2]);
            chmin(dp[i+3], dp[i] + cost);
        }
    }
    cout << dp[N] << endl;
    return 0;
}