n = int(input())
a = [0]*n
b = [0]*n
for i in range(n):
    a[i],b[i] = map(int,input().split())

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

for mask in range(N):
    for i in range(n):
        if mask>>i&1==0: continue
        v = dp[mask][i]
        for j in range(n):
            if mask>>j&1: continue
            dp[mask|(1<<j)][j] = min(dp[mask|(1<<j)][j], max(v,a[j]+b[i]-a[i]))
print(min(dp[-1]))