import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
EPS = 10 ** -10

N = INT()
A = LIST()

if len(set(A)) == 1:
    print(1)
    exit()

A.sort()
r = N // 2
lsm = rsm = 0
for i in range(r+1, N):
    rsm += A[i] - A[r]
for i in range(r-1, -1, -1):
    rsm += A[r] - A[i]

ans = INF
for i in range(N-1):
    l = i // 2
    r = (N+i) // 2
    lsm += A[i] - A[l]
    rsm -= A[r] - A[i]
    ans = min(ans, lsm + rsm)
print(ans)