#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n; cin >> n;
  set<int> st;
  vector<long long> y(n);
  REP(i, n) {
    cin >> y[i];
    st.emplace(y[i]);
  }
  if (st.size() == 1) {
    cout << 1 << '\n';
    return 0;
  }
  if (n == 2) {
    cout << 0 << '\n';
    return 0;
  }
  sort(ALL(y));
  vector<long long> cum(n + 1, 0);
  REP(i, n) cum[i + 1] = cum[i] + y[i];
  int i, j = n - 1;
  long long tmp = LINF;
  for (i = 0; i < j; ++i) {
    int l = i, r = n - 1;
    while (r - l > 1) {
      int mid = (r + l) / 2;
      (y[mid] - y[i] > y[j] - y[mid] ? r : l) = mid;
    }
    long long sum = y[i] * i - (cum[i] - cum[0]);
    sum += (cum[r] - cum[i]) - y[i] * (r - i);
    sum += y[j] * (j - r) - (cum[j] - cum[r]);
    sum += (cum[n] - cum[j]) - y[j] * (n - j);
    if (sum >= tmp) {
      --i;
      break;
    }
    tmp = sum;
  }
  tmp = LINF;
  for (; j > i; --j) {
    int l = i, r = n - 1;
    while (r - l > 1) {
      int mid = (r + l) / 2;
      (y[mid] - y[i] > y[j] - y[mid] ? r : l) = mid;
    }
    long long sum = y[i] * i - (cum[i] - cum[0]);
    sum += (cum[r] - cum[i]) - y[i] * (r - i);
    sum += y[j] * (j - r) - (cum[j] - cum[r]);
    sum += (cum[n] - cum[j]) - y[j] * (n - j);
    if (sum >= tmp) break;
    tmp = sum;
  }
  cout << tmp << '\n';
  return 0;
}