n = int(input())
Y = list(map(int, input().split()))
Y.sort()

prefix = [0] * (n + 1)
for i in range(n):
    prefix[i + 1] = prefix[i] + Y[i]

sum_valid = float('inf')
sum_invalid = float('inf')

for k in range(1, n):
    # Left part: 0 to k-1, size k
    m_left = (k - 1) // 2
    median_left = Y[m_left]
    sum_left_part1 = median_left * (m_left + 1) - (prefix[m_left + 1] - prefix[0])
    sum_left_part2 = (prefix[k] - prefix[m_left + 1]) - median_left * (k - (m_left + 1))
    sum_left = sum_left_part1 + sum_left_part2

    # Right part: k to n-1, size n - k
    right_size = n - k
    m_right = (right_size - 1) // 2
    median_right_pos = k + m_right
    median_right = Y[median_right_pos]
    sum_right_part1 = median_right * (m_right + 1) - (prefix[median_right_pos + 1] - prefix[k])
    sum_right_part2 = (prefix[n] - prefix[median_right_pos + 1]) - median_right * (right_size - (m_right + 1))
    sum_right = sum_right_part1 + sum_right_part2

    if median_left != median_right:
        current_sum = sum_left + sum_right
        if current_sum < sum_valid:
            sum_valid = current_sum
    else:
        current_sum = sum_left + sum_right + min(k, right_size)
        if current_sum < sum_invalid:
            sum_invalid = current_sum

if sum_valid == float('inf'):
    print(sum_invalid)
else:
    if sum_invalid == float('inf'):
        print(sum_valid)
    else:
        print(min(sum_valid, sum_invalid))