from more_itertools import distinct_permutations
from collections import defaultdict
N = int(input())
A = list(map(int,input().split()))

def naive(N,A):
    d = defaultdict(int)
    for i in range(N):
        d[sorted(A)[i]] = i

    ret = 10**18
    ret_p = []
    for p in distinct_permutations(A):
        ans = 0
        for i in range(N-1):
            if(p[i] < 0 and p[i+1] < 0):
                ans += -p[i] - p[i+1]
            else:
                ans += abs(p[i] - p[i+1])
        if(ret > ans):
            ret = ans
            ret_p = [p]
        elif(ret == ans):
            ret_p.append(p)
    print(ret)
    for i in ret_p:
        for j in i:
            print(d[j],end=" ")
        print()

def solve(N,A):
    A.sort()
    ret = 10**18
    use = [A[i] for i in range(1,N)] + [A[0]]
    tmp = 0
    for i in range(N-1):
        if(use[i] < 0 and use[i+1] < 0):
            tmp += -use[i] - use[i+1]
        else:
            tmp += abs(use[i] - use[i+1])
    ret = min(ret,tmp)

    use = [A[i] for i in range(N)]
    tmp = 0
    for i in range(N-1):
        if(use[i] < 0 and use[i+1] < 0):
            tmp += -use[i] - use[i+1]
        else:
            tmp += abs(use[i] - use[i+1])
    ret = min(ret,tmp)
    print(ret)

#naive(N,A)
solve(N,A)