import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

n = II()
ab = LLI(n)

to = [[] for _ in range(n)]
dd = []
for u, (au, bu) in enumerate(ab):
    for v, (av, bv) in enumerate(ab):
        if v == u: continue
        d = bu-au+av
        to[u].append((v, d))
        dd.append(d)
dd.sort()

def binary_search(l, r, ok, minimize):
    if minimize: l -= 1
    else: r += 1
    while l+1 < r:
        m = (l+r)//2
        if ok(m) ^ minimize: l = m
        else: r = m
    if minimize: return r
    return l

def ok(m):
    def dfs(u, lim, c=1):
        if c == n: return True
        for v, d in to[u]:
            if vis[v] or d > lim: continue
            vis[v] = 1
            if dfs(v, lim, c+1): return True
            vis[v] = 0
        return False

    for u in range(n):
        vis = [0]*n
        vis[u] = 1
        if dfs(u, dd[m]): return True
    return False

i = binary_search(0, len(dd), ok, True)
print(dd[i])