N = gets.to_i
Y = gets.split.map(&:to_i).sort
us = Y.uniq.size

if us == 2
  puts 0
  exit
elsif us == 1
  puts 1
  exit
end

def f(arr)
  mid = arr.size / 2
  x = arr[mid]

  arr.map { |v| (v - x).abs }.sum
end

L = Array.new(N, 0)
mid = 0
val = 0
N.times do |i|
  if mid < i / 2
    mid += 1
    val += (mid - 1) * (Y[mid] - Y[mid - 1])
    val -= (i - 1 - mid) * (Y[mid] - Y[mid - 1])
  end

  val += Y[i] - Y[mid]
  L[i] = val
  # pp [:mid, mid, val, f(Y[0..i])]
end

R = Array.new(N, 0)
mid = N - 1
val = 0
(N - 1).downto(0) do |i|
  if (N - 1 - mid) < (N - 1 - i) / 2
    mid -= 1
    val += (N - 1 - mid - 1) * (Y[mid + 1] - Y[mid])
    val -= (mid - i - 1) * (Y[mid + 1] - Y[mid])
  end

  val += Y[mid] - Y[i]
  R[i] = val
  # pp [:mid, mid, val, f(Y[i..])]
end

ans = Float::INFINITY

0.upto(N - 2) do |mid|
  v = L[mid] + R[mid + 1]
  ans = v if ans > v
end

puts ans