#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <functional>
#include <bitset>
#include <cstdint>

using namespace std;
using i64 = int64_t;
using i32 = int32_t;
template<class T, class U> void init_n(vector<T>& v, size_t n, U x) 
{ v = vector<T>(n, x); }
template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }
template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0) 
{ v = vector<T>(n+o); for (size_t i=o; i<n+o; ++i) cin >> v[i]; }
template<class T> void read_n(T a[], size_t n, size_t o = 0)
{ for (size_t i=o; i<n+o; ++i) cin >> a[i]; }
template<class T> T gabs(const T& x) { return max(x, -x); }
#define abs gabs

i64 n;
vector<i64> y, sy;

i64 f(i64 l, i64 r) {
  i64 m = l + (r - l) / 2;
  return sy[r] - sy[m] - (r - m) * y[m] - (sy[m] - sy[l] - (m - l) * y[m]); 
}

int main() {
  cin >> n;
  read_n(y, n);
  sort(begin(y), end(y));
  init_n(sy, n + 2);
  for (i64 i = 1; i <= n; ++i) sy[i] = sy[i - 1] + y[i - 1];
  
  i64 ans = 1ll << 50;
  bool b = false;
  for (i64 i = 1; i < n; ++i) {
    if (y[i / 2] != y[i + (n - i) / 2]) {
      ans = min(ans, f(0, i) + f(i, n));
      b = true;
    }
  }

  if (!b) ans = 1;
  cout << ans << '\n';
  return 0;
}