n = gets.to_i
a = Array.new(n)
(0..(n-1)).each do |i|
  a[i] = gets.to_i
end


if n == 2
  a = a.sort
  p a[1]-a[0]
  return
end

if n == 3
  a = a.sort
  p [(a[2]*2-a[0]-a[1]), (a[2]+a[1]-a[0]*2)].max
  return
end

if a.length.odd?
  a = a.sort!.each_slice(a.length / 2 + 1).to_a
else
  a = a.sort!.each_slice(a.length / 2).to_a
end

p 0
return

a1 = a[0]
a2 = a[1].sort! {|x,y| y<=>x}

sum = 0
l = a1.length
if n.odd?
  (0..l-1).each do |i|
    if i == 0
      sum += (a2[0] + a2[1] - a1[0]*2)
    elsif i == (l-1) || i == (l-2)
      sum += (a2[i-1] - a1[i])
    else
      sum += (a2[i+1] + a2[i-1] - a1[i]*2)
    end
  end
else
  (0..l-1).each do |i|
    if i == 0
      sum += (a2[0] + a2[1] - a1[0]*2)
    elsif i == (l-1)
      sum += (a2[i-1] - a1[i])
    else
      sum += (a2[i+1] + a2[i-1] - a1[i]*2)
    end
  end
end

p sum



