import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

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 = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from itertools import permutations
from random import randrange

n=II()
a=LI()
# a = [randrange(-20,21) for _ in range(n)]
# a=[-20, -2, 1, 4, 11, 14, -9]

def score(a):
    s=0
    for i in range(len(a)-1):
        if a[i]<0 and a[i+1]<0:s+= -a[i]-a[i+1]
        else:s+=abs(a[i]-a[i+1])
    return s

# mn=inf
# ans=None
# for p in permutations(a):
#     s=score(p)
#     if s<mn:mn,ans=s,p
#     if s==mn:print(s,p)
# print(mn,ans)


a.sort()
ans=score(a)
# print(score(a),a)
a.append(a.pop(1))
ans=min(ans,score(a))
print(ans)
# print(score(a),a)