N = int(input())
c = []
for i in range(N):
    l, r = map(int, input().split())
    c.append([l, r-l])

# 整列済み本の集合iを任意の順で並べて、最後尾がj
dp = [[0]*N for _ in range(1<<N)]
for i in range(1,1<<N):
    for j in range(N):
        if not i & (1<<j):
            continue
        for k in range(N):
            if j == k or i & (1<<k):
                continue
            if dp[i ^ (1<<k)][k] == 0:
                dp[i ^ (1<<k)][k] = max(dp[i][j], c[j][1]+c[k][0])
            else:
                dp[i ^ (1<<k)][k] = min(dp[i ^ (1<<k)][k], max(dp[i][j], c[j][1]+c[k][0]))
print(min(dp[-1]))