
/*
TASK: ots
LANG: C++
*/
#include <cstdio>
#include <algorithm>
using namespace std;
long int n;
long int Points[1000000];
void init()
{scanf("%lu",&n);
 for(long int i=0;i<n;i++)
     {scanf("%lu",&Points[i]);
      }
}
int main()
{init();
 sort(&Points[0],&Points[n]);
 long long int min_sum;
 min_sum=Points[1]-Points[0];
 min_sum+=Points[n-1]-Points[n-2];
 n-=2;
 for(long int i=2;i<n;i++)
     {long long int a,b;
      a=Points[i]-Points[i-1];
      b=Points[i+1]-Points[i];
      if( a > b ) min_sum+=b;
      else min_sum+=a;
      }
 //cout<<min_sum<<endl; 
 printf("%lu\n",min_sum);
 return 0;
}
