def main():

    n = int(input())
    A = []
    B = []
    for i in range(n):
        a, b = map(int, input().split())
        A.append(a)
        B.append(b)

    INF = 10**18
    dp = [[INF]*n for i in range(1<<n)]
    for i in range(n):
        dp[1<<i][i] = 0
    for s in range(1, 1<<n):
        for j in range(n):
            if (s>>j)&1:
                continue
            ns = s|(1<<j)
            res = INF
            for i in range(n):
                if not ((s>>i)&1):
                    continue
                res = min(res, max(dp[s][i], B[i]-A[i]+A[j]))
            dp[ns][j] = min(dp[ns][j], res)
    ans = min(dp[-1])
    print(ans)

if __name__ == '__main__':
    main()