N=int(input())
A=[0]*N
B=[0]*N

for i in range(N):
    A[i],B[i]=map(int,input().split())

Ugly=[[0]*N for _ in range(N)]
for i in range(N):
    for j in range(N):
        if i==j:
            continue
        Ugly[i][j]=(B[i]-A[i])+A[j]

inf=float("inf")
DP=[[inf]*N for _ in range(1<<N)]
for i in range(N):
    DP[1<<i][i]=0

for S in range(1,1<<N):
    E=DP[S]
    for u in range(N):
        if S&(1<<u)==0:
            continue

        for v in range(N):
            if S&(1<<v)==0:
                DP[S|(1<<v)][v]=min(DP[S|(1<<v)][v],max(E[u],Ugly[u][v]))

print(min(DP[-1]))