from heapq import *

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

D = set()
E = []
Q = []
cmax = 0
for i in range(N):
    a = A[i]
    b = B[i]
    if a > b:
        a, b = b, a
    c = (a + b) // 2
    d = (a, (a + b) // 2, b)
    E.append(d)
    D |= set(d)
    Q.append((a, i, 0))
    if cmax < a:
        cmax = a
D = sorted(list(D))
heapify(Q)

ans = 10 ** 9
for d in D:
    while d > Q[0][0]:
        _, i, j = heappop(Q)
        if j == 2:
            print(ans)
            exit()
        add = E[i][j + 1]
        if cmax < add:
            cmax = add
        heappush(Q, (add, i, j + 1))
    ans = min(ans, cmax - d)