#include <bits/stdc++.h>

namespace DECLARATIONS {
  using namespace std;

  using ll = long long;
  using PI = pair<int, int>;
  template<class T> using V = vector<T>;
  using VI = V<int>;
#define _1 first
#define _2 second

#ifdef MY_DEBUG
# define DEBUG(x) x
#else
# define DEBUG(x)
#endif

  template<class T>
  inline void debug(T &A) {
    DEBUG(
        for (const auto &a : A) {
          cerr << a << " ";
        }
        cerr << '\n';
    )
  }

  template<class T>
  inline void debug_dim2(T &A) {
    DEBUG(
        for (const auto &as : A) {
          debug(as);
        }
    )
  }

  template<typename ... Args>
  inline void debug(const char *format, Args const &... args) {
    DEBUG(
        fprintf(stderr, format, args ...);
        cerr << '\n';
    )
  }

  template<typename ... Args>
  string format(const std::string &fmt, Args ... args) {
    size_t len = std::snprintf(nullptr, 0, fmt.c_str(), args ...);
    std::vector<char> buf(len + 1);
    std::snprintf(&buf[0], len + 1, fmt.c_str(), args ...);
    return std::string(&buf[0], &buf[0] + len);
  }
}
using namespace DECLARATIONS;

const int MOD = 1000000007;

int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int N;
  cin >> N;
  VI A(N);
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }
  sort(A.begin(), A.end());

  ll sum1 = 0ll;
  int m = N / 2;
  ll sum2 = accumulate(A.begin(), A.end(), 0ll, [&](ll acc, int a){
    return acc + abs(a - A[m]);
  });
  ll ans = (ll)1e18;
  for (int i = 0; i < N - 1; ++i) {
    int med1 = i/2;
    int med2 = (i + N) / 2;
    sum1 += A[i] - A[med1];
    sum2 -= A[med2] - A[i];
    debug("med1:%d med2:%d sum1:%lld sum2:%lld", med1, med2, sum1, sum2);
    if (A[med1] == A[med2]) {
      debug("same %lld", sum1 + sum2 + min(i + 1, N - 1 - i));
      ans = min(ans, sum1 + sum2 + min(i + 1, N - 1 - i));
    } else {
      ans = min(ans, sum1 + sum2);
    }
  }

  cout << ans;

  return 0;
}