n = gets.chomp.to_i
list = n.times.map { gets.chomp.to_i }.sort

if n.odd?
  p_idx = (n / 2)
  piv = list[p_idx]
  if (piv - list[0]).abs > (piv - list[-1]).abs
    front = 1
  else
    front = 0
  end
else
  piv1 = list[(n / 2) - 1]
  piv2 = list[(n / 2)]
  if (piv1 - list[-1]).abs > (piv2 - list[0]).abs
    piv = piv1
    p_idx = (n / 2) - 1
    front = 0
  else
    piv = piv2
    p_idx = n / 2
    front = 1
  end
end

bef = piv
sum = 0
f_idx = 0
b_idx = n - 1
idx = front == 1 ? f_idx : b_idx
while p_idx != idx
  sum += (bef - list[idx]).abs
  if front == 1
    f_idx += 1
  else
    b_idx -= 1
  end
  front = 1 - front
  bef = list[idx]
  idx = front == 1 ? f_idx : b_idx
end
puts sum
