from bisect import bisect_left

N = int(input())
    
if N > 22:
    print(0)
    exit()

rates = list(map(int, input().split()))

eq = []
pl = [[] for _ in range(N)]
mi = [[] for _ in range(N)]

def frontexh(i, dif, rate_sum):
    if i == N // 2:
        if dif == 0:
            eq.append(rate_sum)
        elif dif > 0:
            pl[dif].append(rate_sum)
        else:
            mi[-dif].append(rate_sum)
    else:
        frontexh(i + 1, dif, rate_sum)
        frontexh(i + 1, dif + 1, rate_sum + rates[i])
        frontexh(i + 1, dif - 1, rate_sum - rates[i])

frontexh(0, 0, 0)
    
# 前半分だけを選んで0人のグループとなる場合を除去
if eq:
    eq.pop(0)
eq.sort()

for dif in range(N):
    pl[dif].sort()
    mi[dif].sort()

ans = 2 ** 30

for rate_sum in eq:
    ans = min(ans, abs(rate_sum))

has_anyone = False

def backexh(i, dif, rate_sum):
    global ans, has_anyone
    if i == N - N // 2:
        if dif == 0:
            if has_anyone:
                ans = min(ans, min(ans, abs(rate_sum)))
            else:
                has_anyone = True
            it = bisect_left(eq, -rate_sum)
            if it < len(eq):
                ans = min(ans, abs(rate_sum + eq[it]))
            if it > 0:
                ans = min(ans, abs(rate_sum + eq[it - 1]))
        elif dif > 0:
            it = bisect_left(mi[dif], -rate_sum)
            if it < len(mi[dif]):
                ans = min(ans, abs(rate_sum + mi[dif][it]))
            if it > 0:
                ans = min(ans, abs(rate_sum + mi[dif][it - 1]))
        else:
            it = bisect_left(pl[-dif], -rate_sum)
            if it < len(pl[-dif]):
                ans = min(ans, abs(rate_sum + pl[-dif][it]))
            if it > 0:
                ans = min(ans, abs(rate_sum + pl[-dif][it - 1]))
    else:
        backexh(i + 1, dif, rate_sum)
        backexh(i + 1, dif + 1, rate_sum + rates[N // 2 + i])
        backexh(i + 1, dif - 1, rate_sum - rates[N // 2 + i])

backexh(0, 0, 0)
print(ans)