N = int(input())
A = []
B = []
for _ in range(N):
    pair = list(map(int, input().split()))
    A.append(pair[0])
    B.append(pair[1])

def calc_diffs(n,offset):
    diffs = []
    for i in range(1 << n):
        diff = 0
        for j in range(n):
            if i & (1<<j):
                diff = diff + A[j+offset]
            else:
                diff = diff - B[j+offset]
        diffs.append(diff)
    diffs = list(set(diffs))
    return sorted(diffs)

def lower_bound(n, ns):
    left = 0
    right = len(ns)
    while left < right:
        middle = (left + right)//2
        if 0 <= n + ns[middle]:
            right = middle-1
        else:
            left = middle+1
    return right

def solve():
    if N == 1:
        return min(A[0], B[0])

    ldiffs = calc_diffs(N//2,0)
    rdiffs = calc_diffs(N-N//2, N//2)

    mindiff = float('inf')
    for left in ldiffs:
        i = lower_bound(left, rdiffs)
        for j in range(-1,2):
            index = i+j
            if 0 <= index < len(rdiffs):
                mindiff = min(mindiff, abs(left+rdiffs[index]))
    return mindiff

print(solve())