#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
const ll INF = 1e14;
const int MOD = 1000000007;

int main(){
    int n;
    cin >> n;
    vector<ll> Y(n);
    rep(i,n) cin >> Y[i];
    sort(Y.begin(),Y.end());
    vector<ll> dp(n+1,INF);
    dp[0] = 0;
    for(int i=1;i<=n;i++){
        if(i-2>=0){
            dp[i] = min(dp[i],dp[i-2] + abs(Y[i-1]-Y[i-2]));
        }if(i-3>=0){
            dp[i] = min(dp[i],dp[i-3] + abs(Y[i-1]-Y[i-2]) + abs(Y[i-2]-Y[i-3]));
        }
    }
    cout << dp[n] << endl;
    return 0;
}