#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

void Main() {
  ll n;
  R n;
  ll a[n];
  rep(i,n) R a[i];
  ll ans=0;
  rep(k,2) {
    sort(a,a+n);
    vector<int> v[2];
    rep(i,n) {
      if(i<n/2-k) v[0].pb(a[i]);
      else if(i>n/2-k) v[1].pb(a[i]);
    }
    vector<ll> b;ll sum=0;
    b.pb(a[n/2-k]);
    rep(i,max(v[0].size(),v[1].size())) {
      if(i<v[0].size()) b.pb(v[0][i]);
      if(i<v[1].size()) b.pb(v[1][i]);
    }
    REP(i,1,b.size()) sum+=abs(b[i-1]-b[i]);
    ans=max(ans,sum);
    b.clear();sum=0;
    b.pb(a[n/2-k]);
    rep(i,max(v[0].size(),v[1].size())) {
      if(i<v[1].size()) b.pb(v[1][i]);
      if(i<v[0].size()) b.pb(v[0][i]);
    }
    REP(i,1,b.size()) sum+=abs(b[i-1]-b[i]);
    ans=max(ans,sum);
    reverse(all(v[0]));
    b.clear();sum=0;
    b.pb(a[n/2-k]);
    rep(i,max(v[0].size(),v[1].size())) {
      if(i<v[0].size()) b.pb(v[0][i]);
      if(i<v[1].size()) b.pb(v[1][i]);
    }
    REP(i,1,b.size()) sum+=abs(b[i-1]-b[i]);
    ans=max(ans,sum);
    b.clear();sum=0;
    b.pb(a[n/2-k]);
    rep(i,max(v[0].size(),v[1].size())) {
      if(i<v[1].size()) b.pb(v[1][i]);
      if(i<v[0].size()) b.pb(v[0][i]);
    }
    REP(i,1,b.size()) sum+=abs(b[i-1]-b[i]);
    ans=max(ans,sum);
    reverse(all(v[1]));
    b.clear();sum=0;
    b.pb(a[n/2-k]);
    rep(i,max(v[0].size(),v[1].size())) {
      if(i<v[0].size()) b.pb(v[0][i]);
      if(i<v[1].size()) b.pb(v[1][i]);
    }
    REP(i,1,b.size()) sum+=abs(b[i-1]-b[i]);
    ans=max(ans,sum);
    b.clear();sum=0;
    b.pb(a[n/2-k]);
    rep(i,max(v[0].size(),v[1].size())) {
      if(i<v[1].size()) b.pb(v[1][i]);
      if(i<v[0].size()) b.pb(v[0][i]);
    }
    REP(i,1,b.size()) sum+=abs(b[i-1]-b[i]);
    ans=max(ans,sum);
    reverse(all(v[0]));
    b.clear();sum=0;
    b.pb(a[n/2-k]);
    rep(i,max(v[0].size(),v[1].size())) {
      if(i<v[0].size()) b.pb(v[0][i]);
      if(i<v[1].size()) b.pb(v[1][i]);
    }
    REP(i,1,b.size()) sum+=abs(b[i-1]-b[i]);
    ans=max(ans,sum);
    b.clear();sum=0;
    b.pb(a[n/2-k]);
    rep(i,max(v[0].size(),v[1].size())) {
      if(i<v[1].size()) b.pb(v[1][i]);
      if(i<v[0].size()) b.pb(v[0][i]);
    }
    REP(i,1,b.size()) sum+=abs(b[i-1]-b[i]);
    ans=max(ans,sum);
  }
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}


Measured memory_bytes: 3292