import bisect
N=int(input())
A=list(map(int,input().split()))
rest = N - N//2
d = [[] for _ in range(N//2+1)]
for i in range(2**(N//2)):
    cnt = 0
    s = 0
    for j in range(N//2):
        if (i>>j)&1:
            cnt += 1
            s += A[j]
        else:
            s -= A[j]
    d[cnt].append(s)
ans = 10**18
for i in range(2**rest):
    cnt = 0
    s = 0
    for j in range(N//2):
        if (i>>j)&1:
            cnt += 1
            s += A[N//2+j]
        else:
            s -= A[N//2+j]
    idx = bisect.bisect_left(d[N//2-cnt],-s)
    #print(d[N//2-cnt],cnt,s,idx)
    if 0<=idx<len(d[N//2-cnt]):
        ans = min(ans, abs(d[N//2-cnt][idx]+s))
    if 0<=idx-1<len(d[N//2-cnt]):
        ans = min(ans, abs(d[N//2-cnt][idx-1]+s))
    if 0<=idx+1<len(d[N//2-cnt]):
        ans = min(ans, abs(d[N//2-cnt][idx+1]+s))
print(ans)