n = int(input())
A = [0]*n
B = [0]*n
for i in range(n):
    a, b = map(int, input().split())
    A[i] = a
    B[i] = b

p = n//2
q = n-p
A1 = A[0:p]
A2 = A[p:n]
B1 = B[0:p]
B2 = B[p:n]
D1 = []
D2 = []
for i in range(2**p):
    a = 0
    b = 0
    for j in range(p):
        if (i >> j) & 1:
            a += A1[j]
        else:
            b += B1[j]
    D1.append(a-b)

for i in range(2**q):
    a = 0
    b = 0
    for j in range(q):
        if (i >> j) & 1:
            a += A2[j]
        else:
            b += B2[j]
    D2.append(a-b)
D2.sort()
D2 = [-10**18] + D2 + [10**18]
import bisect
ans = 10**18
for d in D1:
    id = bisect.bisect_right(D2, -d)
    ans = min(ans, min(abs(D2[id-1]+d), abs(D2[id]+d)))
print(ans)