N = int(input())
A = list(map(int, input().split()))
A.sort()

S = [0]
for a in A:
    S.append(S[-1] + a)


def better(i, n):
    p = A[-n] - A[i]
    m = A[i] - A[i-n]
    return p > m


def calc_score(i):
    ai = A[i]
    nl = i
    nr = N - i - 1
    n = min(nl, nr)
    left = 1
    right = n
    if better(i, right):
        h = S[N] - S[N-n]
        l = S[i] - S[i-n]
        score = h + l - ai*n*2
        return score
    
    if not better(i, 1):
        return A[-1] + A[i-1] - 2*A[i]
    
    while right-left > 1:
        mid = (right + left) // 2
        if better(i, mid):
            left = mid
        else:
            right = mid
    
    h = S[N] - S[N-left]
    l = S[i] - S[i-left]
    score = h + l - ai*left*2
    return score

ans = 0
for i in range(N):
    ans = max(ans, calc_score(i))

print(ans)