#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <functional>

using namespace std;
typedef long long int ll;

#define repi(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,a) repi(i,0,a)
#define rrep(i,a) for(ll i=a-1;i>=0;i--)

int main(){
  ll N;
  cin >> N;
  ll Y[N];
  rep(i, N) cin >> Y[i];
  sort(Y, Y+N);
  if(Y[0] == Y[N-1]){
    cout << 1 << endl;
  }
  else{  
    ll border = 1;
    ll cent1 = 0, cent2 = N / 2;
    ll sum = 0;
    repi(i, 1, N) sum += abs(Y[i] - Y[cent2]);
    ll ans = sum;

    while((++border) < N){
      if(border % 2) cent1++;
      if((N - border) % 2) cent2++;
      sum += Y[border-1] * 2 - Y[cent1] - Y[cent2];
      if(sum < ans) ans = sum;
    }
    cout << ans << endl;
  }
  return 0;
}