import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

n = II()
aa = LI()

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

aa.sort()
l = 0
a0 = aa[n//2]
r = sum(abs(a-a0) for a in aa)

ans=inf
for m in range(1, n):
    if m & 1: l += aa[m-1]-aa[m//2]
    else: l += aa[m-1]-aa[m//2-1]
    mid=(m+n)//2
    if (n-m)&1:r-=aa[mid]-aa[m-1]
    else:r-=aa[mid-1]-aa[m-1]
    ans=min(ans,l+r)

print(ans)