def rec(S, v):
    if memo[S][v] != -1:
        return memo[S][v]
    
    if S == (1 << N) - 1:
        return 0
    
    res = 10 ** 18
    
    for u in range(N):
        if not S >> u & 1:
            res = min(res, max(rec(S | 1 << u, u), B[v] - A[v] + A[u]))
    
    memo[S][v] = res
    
    return res

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

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

memo = [[-1 for _ in range(N)] for _ in range(1 << N)]
ans = 10 ** 18

for i in range(N):
    ans = min(ans, rec(1 << i, i))

print(ans)