#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  set<int> s;
  vector<int> x(n);
  REP (i, n) {
    cin >> x[i];
    s.insert(x[i]);
  }

  if (s.size() == 1)
    cout << 1 << endl;
  else if (s.size() == 2)
    cout << 0 << endl;
  else {
    sort(x.begin(), x.end());

    int m = -1;

    for (int i = 1; i < n-1; i++) {
      int l = i / 2;
      int r = n - 1 - (n - i - 1) / 2;
      if (x[i] - x[l] >= x[r] - x[i]) {
        m = i;
        break;
      }
    }

    long long ret = 0;
    REP (i, m)
      ret += abs(x[m/2] - x[i]);
    for (int i = m; i < n; i++)
      ret += abs(x[n - 1 - (n - m - 1) / 2] - x[i]);
    
    cout << ret << endl;
  }
  
  return 0;
}