n = gets.to_i
a = gets.split.map(&:to_i).sort
if a[0] == a[-1]
  puts 1
  exit
end

s = [0] * (n+1)
n.times do |i|
  s[i+1] = s[i] + a[i]
end
ans = 10**100
(1..n-1).each do |i|
  f = ->(l, r) do
    m1 = (l + r) / 2
    m2 = (l + r + 1) / 2
    (s[r]-s[m2])-(s[m1]-s[l])
  end
  ans = [ans, f.(0,i) + f.(i,n)].min
end

puts ans