INF = 1 << 60
N = int(input())
bs = []
for _ in range(N):
    A, B = map(int, input().split())
    bs.append((A, B))


# 本 i, j 間のしおりの距離
def distance(i, j) -> int:
    ia, ib = bs[i]
    ja, _ = bs[j]
    return (ib - ia) + ja


dp = [[INF] * N for _ in range(1 << N)]
for i in range(N):
    dp[1 << i][i] = 0


for i in range(1 << N):
    for j in range(N):  # 最後においた本
        if ~i & (1 << j): continue

        for k in range(N):  # 次におく本
            if i & (1 << k): continue

            d = distance(j, k)
            ni = i | (1 << k)
            dp[ni][k] = min(dp[ni][k], max(dp[i][j], d))


bit_all = (1 << N) - 1
ans = min(dp[bit_all][i] for i in range(N))
print(ans)