#include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=1e5+7;
static const ll MOD=1e9+7;
ll max(ll a, ll b) {return a>b?a:b;}
ll min(ll a, ll b) {return a<b?a:b;}



int main(void) {
  ll N;
  cin >> N;
  ll x[MAX];
  ll i;
  ll s[MAX]={};
  
  x[0]=-INF;
  for(i=1; i<=N; i++) cin >> x[i];
  sort(x+1, x+N+1);
  x[N+1]=INF;
  for(i=1; i<=N; i++) s[i]=s[i-1]+x[i];
  
  if(x[1]==x[N]) {
    pt(1);
    return 0;
  }
  
  ll ans=INF;
  for(i=1; i<N; i++) {
    ll l=i/2+1;
    ll r=(N+i)/2+1;
    
    ll ls=s[i]-s[l]-x[l]*(i-l)+x[l]*(l-1)-s[l-1];
    ll rs=s[N]-s[r]-x[r]*(N-r)+x[r]*(r-i-1)-(s[r-1]-s[i]);
    
    //pt(ls<<" "<<rs);
    chmin(ans, ls+rs);
  }
  pt(ans);
}