/*
TASK: ots
LANG: C++
*/
#include <iostream>
#include <limits.h>
using namespace std;

int N;
int A[1000000];
int B[1000000];
int sum;

int main()
{
    cin>>N;
    for(int i=0; i<N; i++)
    {
            cin>>A[i];
    }
    sort(A, A+N);
    sum+=A[1]-A[0];
    sum+=A[N-1]-A[N-2];
    B[0] = 1;
    B[1] = 1;
    B[N-1] = 1;
    B[N-2] = 1;
    for(int k=1; k<N-2; k++)
    {
            if(B[k]) continue;
            else
            {
                int dif = min(A[k]-A[k-1], A[k+1]-A[k]);
                if(dif!=A[k]-A[k-1]) {B[k]=1; B[k+1] = 1; sum+=dif;}
                else {sum+=dif; B[k]=1; B[k-1] = 1;}
            }
    }
    cout<<sum<<'\n';
    return 0;
}
