import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

int N;
long[] Y;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      Y = new long[N];
      foreach (i; 0 .. N) {
        Y[i] = readLong();
      }
      
      Y.sort;
      auto YSum = new long[N + 1];
      foreach (i; 0 .. N) {
        YSum[i + 1] = YSum[i] + Y[i];
      }
      
      long ans = INF;
      if (Y[0] == Y[N - 1]) {
        ans = 1;
      } else {
        foreach (k; 1 .. N) {
          const l = (0 + (k - 1)) / 2;
          const r = (k + (N - 1)) / 2;
          long cost;
          cost += Y[l] * (l - 0) - (YSum[l] - YSum[0]);
          cost += (YSum[k] - YSum[l]) - Y[l] * (k - l);
          cost += Y[r] * (r - k) - (YSum[r] - YSum[k]);
          cost += (YSum[N] - YSum[r]) - Y[r] * (N - r);
          chmin(ans, cost);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}