import sys
input = sys.stdin.readline
from collections import *
from heapq import *

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = [(A[i]+B[i])//2 for i in range(N)]
ms = A+B+C
ms.sort()
L = [[A[i], B[i], C[i]] for i in range(N)]

for i in range(N):
    L[i].sort(reverse=True)
    
pq = []
M = 0

for i in range(N):
    M = max(M, L[i][-1])
    heappush(pq, (L[i].pop(), i))

ans = 10**18

for m in ms:
    while pq[0][0]<m:
        _, i = heappop(pq)
        
        if len(L[i])==0:
            exit(print(ans))
        
        M = max(M, L[i][-1])
        heappush(pq, (L[i].pop(), i))
    
    ans = min(ans, M-m)

print(ans)