n = int(input())
As = []
Bs = []
for i in range(n):
    a, b = map(int, input().split())
    As.append(a)
    Bs.append(b)

def solve(n, As, Bs):
    n1 = n // 2
    n2 = n - n1
    A1 = As[:n1]
    A2 = As[n1:]
    B1 = Bs[:n1]
    B2 = Bs[n1:]
    lst1 = generate_lst(n1, A1, B1)
    lst2 = generate_lst(n2, B2, A2)
    lst1.sort()
    lst2.sort()
    record = float('inf')
    idx2 = 0
    for d1 in lst1:
        while (idx2 < len(lst2) and d1 - lst2[idx2] > 0):
            record = min(record, abs(d1 - lst2[idx2]))
            idx2 += 1
        if (idx2 < len(lst2)):
            record = min(record, abs(d1 - lst2[idx2]))
    return record

def generate_lst(n, A, B):
    lst = []
    for pat in range(1 << n):
        tmp = 0
        for i in range(n):
            if pat & (1 << i):
                tmp += A[i]
            else:
                tmp -= B[i]
        lst.append(tmp)
    return lst

print(solve(n, As, Bs))