#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

const ll MAXn=1e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;

MinHeap<ll> mnpq;
map<ll,ll> cnt;
int d[MAXn];
int main(){
  IOS();
  ll n;
  cin>>n;
  REP(i,n) cin>>d[i];
  if( n==2 ) return cout<<abs(d[0]-d[1])<<endl,0;
  sort(d,d+n);
  ll ans = 0;
  if( n&1 ){
    ll mid = n/2;
    ll tmp;
    if( d[mid+1]-d[mid]>d[mid]-d[mid-1] ) tmp = mid-1;
    else tmp = mid+1;
    REP(i,n)REP(j,2){
      if( j==1 && (i==mid || i==tmp) ) continue;
      cnt[d[i]]++;
      mnpq.push(d[i]);
      debug(d[i]);
    }
    for(ll i=n-1;i>=0;i--){
      if( cnt[d[i]]==0 ) continue;
      else if( cnt[d[i]]==1 ){
        while( cnt[mnpq.top()]==0 ) mnpq.pop();
        ll cur = mnpq.top();
        mnpq.pop();
        ans += d[i]-cur;
        cnt[d[i]]=0;
        cnt[cur]--;
      }
      else{
        while( cnt[mnpq.top()]==0 ) mnpq.pop();
        ll cur1 = mnpq.top();
        mnpq.pop();
        while( cnt[mnpq.top()]==0 ) mnpq.pop();
        ll cur2 = mnpq.top();
        mnpq.pop();
        ans += d[i]-cur1+d[i]-cur2;
        cnt[d[i]]-=2;
        cnt[cur1]--;
        cnt[cur2]--;
      }
    }
  }
  else{
    ll mid = n/2;
    ll tmp = mid-1;
    REP(i,n)REP(j,2){
      if( j==1 && (i==mid || i==tmp) ) continue;
      cnt[d[i]]++;
      mnpq.push(d[i]);
      debug(d[i]);
    }
    for(ll i=n-1;i>=0;i--){
      debug(i);
      if( cnt[d[i]]==0 ) continue;
      else if( cnt[d[i]]==1 ){
        while( SZ(mnpq) && cnt[mnpq.top()]==0 ) mnpq.pop();
        ll cur = mnpq.top();
        mnpq.pop();
        ans += d[i]-cur;
        cnt[d[i]]=0;
        cnt[cur]--;
      }
      else{
        while( SZ(mnpq) && cnt[mnpq.top()]==0 ) mnpq.pop();
        ll cur1 = mnpq.top();
        mnpq.pop();
        while( SZ(mnpq) && cnt[mnpq.top()]==0 ) mnpq.pop();
        ll cur2 = mnpq.top();
        mnpq.pop();
        ans += d[i]-cur1+d[i]-cur2;
        cnt[d[i]]-=2;
        cnt[cur1]--;
        cnt[cur2]--;
      }
    }
  }
  cout<<ans<<endl;
}


Measured memory_bytes: 8944