N = gets.to_i
Y = gets.split.map &:to_i
case Y.uniq.size
when 1
  p 1
when 2
  p 0
else
  Y.sort!
  r = Y.dup
  l = []
  lsum = l.sum
  rsum = r.sum
  ans = 1.0/0
  (N-1).times{
    n = r.shift
    l << n
    lsum += n
    rsum -= n
    lave = lsum.fdiv(l.size).round
    ldist = l.map{|n| (n - lave).abs }.sum
    rave = rsum.fdiv(r.size).round
    rdist = r.map{|n| (n - rave).abs }.sum
    ans = ldist + rdist if ldist + rdist < ans
  }
  p ans
end