from itertools import*
from math import*
from collections import*
from heapq import*
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf = float("inf")
mod = 10**9+7
from functools import reduce
import sys
sys.setrecursionlimit(10**7)

N = int(input())
Y = list(map(int,input().split()))
Y.sort()
S  =[0]*(N+1)
def mid(l):
    x = len(l)-1
    if x%2 == 0:
        return x//2,l[x//2]
    else:
        return (x-1)//2+1,(l[(x-1)//2]+l[(x-1)//2+1])//2
ans = inf
for i in range(1,N+1):
    S[i] += S[i-1]+Y[i-1]
for i in range(N//2,N//2+2):
    x1,m1 = mid(Y[:i])
    x2,m2 = mid(Y[i:])
    cur = (m1*x1-S[x1])+(S[i]-S[x1]-m1*(i-x1))
    cur += (m2*x2-(S[i+x2]-S[i]))+(S[N]-S[i+x2]-m2*(N-i-x2))
    ans = min(ans,cur)
print(ans)