INF = 100000
MAX_N = 20
N = int(input())
A = []
B = []
for i in range(N):
    a, b = map(int, input().split())
    A.append(a)
    B.append(b - a)
DP = []
for i in range(1 << N):
    DP.append([])
    for j in range(N):
        DP[i].append(INF)
for i in range(1 << N):
    for j in range(N):
        if i & (1 << j):
            for k in range(N):
                if not i & (1 << k):
                    new_max = (B[j] + A[k]) if DP[i][j] == INF else max(DP[i][j], B[j] + A[k])
                    new_bit = i | (1 << k)
                    DP[new_bit][k] = min(DP[new_bit][k], new_max)
res = INF
for i in range(N):
    res = min(res, DP[(1 << N) - 1][i])
print(res)