#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<int> y(n);
  REP(i, n) {
    cin >> y[i];
    st.emplace(y[i]);
  }
  if (st.size() == 1) {
    cout << 1 << '\n';
    return 0;
  }
  sort(ALL(y));
  vector<int> low, high;
  if (n & 1) {
    int tmp = (n + 1) / 4;
    low.emplace_back(y[tmp]);
    if (n % 4 == 3) low.emplace_back(y[tmp - 1]);
    int mid = n / 2;
    tmp = (n + mid) / 2;
    high.emplace_back(y[tmp]);
    if (n % 4 == 3) high.emplace_back(y[tmp - 1]);
  } else {
    int tmp = n / 4;
    low.emplace_back(y[tmp]);
    if (n % 4 == 0) low.emplace_back(y[tmp - 1]);
    int mid = n / 2;
    tmp = (n + mid) / 2;
    high.emplace_back(y[tmp]);
    if (n % 4 == 0) high.emplace_back(y[tmp - 1]);
  }
  long long ans = LINF;
  for (int l : low) for (int h : high) {
    long long sum = 0;
    REP(i, n) sum += min(abs(y[i] - l), abs(y[i] - h));
    ans = min(ans, sum);
  }
  cout << ans << '\n';
  return 0;
}