import sys
input = sys.stdin.readline

N = int(input())
A, B = [], []

for _ in range(N):
    Ai, Bi = map(int, input().split())
    A.append(Ai)
    B.append(Bi)

dp = [[10 ** 18 for _ in range(N)] for _ in range(1 << N)]

for v in range(N):
    dp[(1 << N) - 1][v] = 0
    
for S in range((1 << N) - 2, -1, -1):
    for v in range(N):
        for u in range(N):
            if not S >> u & 1:
                dp[S][v] = min(dp[S][v], max(dp[S | 1 << u][u], B[v] - A[v] + A[u]))

ans = 10 ** 18

for i in range(N):
    ans = min(ans, dp[1 << i][i])

print(ans)