local mfl, mmi = math.floor, math.min
local n = io.read("*n")
local t = {}
local sum = {}
for i = 1, n do
  t[i] = io.read("*n")
end
table.sort(t)
sum[1] = t[1]
for i = 2, n do
  sum[i] = sum[i - 1] + t[i]
end
local minval = nil
for i = 1, n - 1 do
  local leftcenter = mfl((1 + i) / 2)
  local leftlen = 0
  if 1 < leftcenter then
    leftlen = leftlen + t[leftcenter] * (leftcenter - 1) - sum[leftcenter - 1]
  end
  if leftcenter < i then
    leftlen = leftlen + sum[i] - sum[leftcenter] - t[leftcenter] * (i - leftcenter)
  end
  local rightcenter = mfl((i + 1 + n) / 2)
  local rightlen = 0
  if i + 1 < rightcenter then
    rightlen = rightlen + t[rightcenter] * (rightcenter - i - 1)
             - sum[rightcenter - 1] + sum[i]
  end
  if rightcenter < n then
    rightlen = rightlen + sum[n] - sum[rightcenter] - t[rightcenter] * (n - rightcenter)
  end
  if not minval then
    minval = leftlen + rightlen
  else
    minval = mmi(minval, leftlen + rightlen)
  end
end
if t[1] == t[n] then print(1) else print(minval) end