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

AB1 = AB[:N // 2]
AB2 = AB[N // 2:]

def f(X):
    n = len(X)
    res = []
    for status in range(1 << n):
        val = 0
        for i in range(n):
            if (status >> i) & 1:
                val += X[i][0]
            else:
                val -= X[i][1]
        res.append(val)
    return res
    
AB1 = set(f(AB1))
AB2 = sorted(set(f(AB2)))

import bisect
INF = 1 << 60
ans = INF
for val in AB1:
    # -valに一番近い数をAB2から探す
    ind = bisect.bisect_left(AB2, -val)
    if ind - 1 >= 0:
        ans = min(ans, abs(AB2[ind - 1] + val))
    if ind < len(AB2):
        ans = min(ans, abs(AB2[ind] + val))
print(ans)