N = int(input())

if N > 22:
    print(0)
    exit()

rates = list(map(int, input().split()))
combs = [[] for k in range(11 + 1)]
rate_sums = [0 for comb in range(1 << N)]
for comb in range(1 << N):
    if comb.bit_count() > 11:
        continue
    rate_sum = 0
    for i in range(N):
        if (comb >> i) & 1: rate_sum += rates[i]
    combs[comb.bit_count()].append(comb)
    rate_sums[comb] = rate_sum

ans = 2 ** 60
for k in range(1, 11 + 1):
    combs[k].sort(key = lambda comb: rate_sums[comb])
    for i in range(len(combs[k]) - 1):
        ans = min(ans, abs(rate_sums[combs[k][i]] - rate_sums[combs[k][i + 1]]))
print(ans)