from bisect import bisect_left
N = int(input())
A = [list(map(int,input().split())) for _ in range(N)]
X = set()
Y = set()
if N <= 16:
    for i in range(1<<N):
        tmp = 0
        x = i
        for j in range(N):
            if x & 1:
                tmp += A[j][1]
            else:
                tmp -= A[j][0]
            x >>= 1
        X.add(tmp)
    X = sorted(list(X))
    NX = len(X)
    a = bisect_left(X,0)
    if a == NX:
        print(abs(X[a-1]))
    elif a == 0:
        print(abs(X[0]))
    else:
        print(min(abs(X[a-1]),abs(X[a])))
else:
    for i in range(1<<16):
        tmp = 0
        x = i
        for j in range(16):
            if x & 1:
                tmp += A[j][1]
            else:
                tmp -= A[j][0]
            x >>= 1
        X.add(tmp)
    X = sorted(list(X))
    NX = len(X)
    for i in range((N-16)<<16):
        tmp = 0
        x = i
        for j in range(16,N):
            if x & 1:
                tmp += A[j][0]
            else:
                tmp -= A[j][1]
            x >>= 1
        Y.add(tmp)
    Y = sorted(list(Y))
    ans = 10 ** 14
    for y in Y:
        a = bisect_left(X,y)
        if a == NX:
            ans = min(ans,abs(X[a-1]-y))
        elif a == 0:
            ans = min(ans,abs(X[0]-y))
        else:
            ans = (min(abs(X[a-1]-y),abs(X[a]-y)))
    print(ans)