n = gets.to_i
y = gets.split.map(&:to_i)

r = (y.sort!).clone
l = []
l << r.shift

# すべて同じ値の場合は1
if y[0] == y[-1]
  puts 1
  exit
end

candi = []
while not r.empty?
  sum = 0
  [r, l].each do | ary |
    c = ary[ary.size/2]
    ary.each do | a |
      sum += (a-c).abs
    end
  end
  candi << sum
  l << r.shift
end
p candi.min