#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007;

int main(){
   
    int N;cin>>N;
    vector<ll> S(N);
    vector<bool> T(N,0);
    for(int i=0;i<N;i++){
        cin>>S[i];
    }
    sort(all(S));
    ll sum=0;
    for(int i=0;i<N;i++){
        if(i==0){
            sum+=S[1]-S[0];
            S[0]=S[1];
        }else if(i!=N-1){
            if(S[i]==S[i-1]) continue;
            else if(S[i]==S[i+1]) continue;
            else if(S[i]-S[i-1]<S[i+1]-S[i]){
                sum+=S[i]-S[i-1];
                S[i]=S[i-1];
            }else{
                sum+=S[i+1]-S[i];
                S[i]=S[i+1];
            }
        }else sum+=S[i]-S[i-1];
        
    }
    cout<<sum<<endl;
        }