from bisect import bisect_left
import sys
input = sys.stdin.readline

n = int(input())
AB = [list(map(int, input().split())) for _ in range(n)]

n1 = n // 2
P1 = []
for bit in range(1 << n1):
    res = 0
    for i in range(n1):
        if (bit >> i) & 1:
            res += AB[i][0]
        else:
            res -= AB[i][1]
    P1.append(res)
P1 = sorted(set(P1))
m1 = len(P1)

n2 = n - n1
P2 = []
for bit in range(1 << n2):
    res = 0
    for i in range(n2):
        if (bit >> i) & 1:
            res += AB[n1 + i][0]
        else:
            res -= AB[n1 + i][1]
    P2.append(res)
P2 = sorted(set(P2))
m2 = len(P2)

ans = 10**18
for i in range(m1):
    p1 = P1[i]
    idx = bisect_left(P2, -p1)
    ans = min(ans, abs(p1 + P2[idx - 1]), abs(p1 + P2[idx]))
print(ans)