from bisect import bisect_left, bisect, insort_left, insort
n = int(input())
y = sorted(map(int, input().split()))
sum_y = sum(y)
m = {}
def f(a):
    if a not in m:
        l = bisect_left(y, a)
        sum_yl = sum(y[:l])
        m[a] = abs(sum_yl - a * l) + abs((sum_y - sum_yl) - a * (n - l))
    return m[a]
l = min(y)
r = max(y)
for _ in range(100):
    mid_l = (l * 2 + r) // 3
    mid_r = (l + r * 2) // 3
    if f(mid_l) > f(mid_r):
        l = mid_l
    else:
        r = mid_r
ans = 1e15
for i in range(l, r + 1):
    ans = min(ans, f(i))
print(ans)