from bisect import bisect

n=int(input())

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

B0=B[:n//2]
B1=B[n//2:]

X=[]
Y=[]

for i in range(1<<len(B0)):
    score=0

    for j in range(len(B0)):
        if i & (1<<j) != 0:
            score+=B0[j][0]
        else:
            score-=B0[j][1]

    X.append(score)


for i in range(1<<len(B1)):
    score=0

    for j in range(len(B1)):
        if i & (1<<j) != 0:
            score+=B1[j][0]
        else:
            score-=B1[j][1]

    Y.append(score)

X.sort()
Y.sort()

ind=len(Y)-1

ANS=1<<60

for i in range(len(X)):
    while ind-1>=0 and abs(X[i]+Y[ind])>abs(X[i]+Y[ind-1]):
        ind-=1

    ANS=min(ANS,abs(X[i]+Y[ind]))

print(ANS)