import math
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10**7)

N = int(input())

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

rates = list(map(int, input().split()))
rate_sums = list(range(math.factorial(N) // math.factorial(N // 2) // math.factorial(N - N // 2)))
index = 0

def exh(bit, rate_sum, k):
    if bit.bit_count() == N // 2:
        global index
        rate_sums[index] = rate_sum
        index += 1
    else:
        for i in range(k + 1, N - N // 2 + bit.bit_count() + 1):
            exh(bit | (1 << i), rate_sum + rates[i], i)

exh(0, 0, -1)
rate_sums.sort()
ans = 1 << 30
for i in range(len(rate_sums) - 1):
    if ans > abs(rate_sums[i] - rate_sums[i + 1]):
        ans = abs(rate_sums[i] - rate_sums[i + 1])
print(ans)