from random import randint
from more_itertools import distinct_permutations

def f(x, y):
    if x < 0 and y < 0:
        return -x - y
    else:
        return abs(x-y)

def cost(A):
    ret = 0
    for i in range(len(A)-1):
        ret += f(A[i], A[i+1])
    return ret
    
# A = [randint(-10, 10) for i in range(8)]
# A = [117, 96, 102, 55, -104, -123, -108, 79, -131]
# mncost = 10**9
# for X in distinct_permutations(A):
#     if cost(X) < mncost:
#         mncost = cost(X)
# print(mncost)
# for X in distinct_permutations(A):
#     if cost(X) == mncost:
#         print(X)

N = int(input())
A = list(map(int, input().split()))
if min(A) >= 0:
    #普通に
    print(max(A) - min(A))
elif max(A) < 0:
    A.sort()
    ans = sum(-a for a in A)
    ans += A[0]
    ans += A[1]
    print(ans)
else:
    A.sort()
    #両端
    ans = 0
    if A[1] < 0:
        for a in A:
            if a < 0:
                ans += -2 * a
        ans += A[0]
        ans += A[1]
        ans += max(A) * 2
    #片方
    ans = min(ans, cost(A))
    print(ans)