import sys
input = sys.stdin.readline

from bisect import bisect

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

SUM=sum(A)

B=A[:N//2]
C=A[N//2:]

XB=[[] for i in range(N//2+1)]
for i in range(1<<len(B)):
    score=0
    count=0
    for j in range(len(B)):
        if i & (1<<j) != 0:
            score+=B[j]
            count+=1

    XB[count].append(score)

for i in range(len(XB)):
    XB[i].sort()

ANS=1<<63
for i in range(1<<len(C)):
    score=0
    count=0
    for j in range(len(C)):
        if i & (1<<j) != 0:
            score+=C[j]
            count+=1
    k=N//2-count

    need=SUM//2-score

    xx=bisect(XB[k],need)

    for ix in range(xx-1,xx+1):
        if 0<=ix<len(XB[k]):
            p=score+XB[k][ix]

            ANS=min(ANS,abs(p-(SUM-p)))

print(ANS)