/*
TASK:ots
LANG:C++
*/
#include<iostream>
using namespace std;
int main()
{int nn,n[1000000],br,i;
cin>>nn;
for(i=1;i<=nn;i++)
cin>>n[i];
sort(n,n+nn+1);
if(nn==2)
{
cout<<n[2]-n[1]<<"\n";
return 0;
}
if(nn==3)
{
cout<<n[3]-n[1]<<"\n";
return 0;
}
if(nn==4)
{
cout<<n[4]-n[3]+n[2]-n[1]<<"\n";
return 0;
}
br=n[nn]-n[nn-1];
i=nn-2;
while(i>2)
{//1
if(n[i]-n[i-1]<=n[i+1]-nn)
{
br=br+n[i]-n[i-1];
i=i-2;
}
else 
{
br=br+n[i+1]-n[i];
i=i-1;
}
}//2
br=br+n[2]-n[1];
cout<<br<<"\n";
return 0;//LopiTo
}
