rr = raw_input
rrm = lambda: map(int, rr().split())

def solve(N, A):
    A.sort()
    P = [0]
    for x in A:
        P.append(P[-1] + x)

    def sumrange(i, j): # A[i]..A[j]
        return P[j+1] - P[i]

    def medianrange(i, j):
        k = (i+j) / 2
        med = A[k]
        ans = (k-i) * A[k] - sumrange(i, k)
        ans += sumrange(k+1, j) - (j-(k+1)) * A[k]
        return ans

    ans = float('inf')
    for i in xrange(N-1):
        # [0..i] [i+1..N-1]
        bns = medianrange(0, i) + medianrange(i+1, N-1)
        ans = min(ans, bns)
    return ans
    
print solve(int(rr()), rrm())