from collections import deque

n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[deque() for i in range(n)];d=0;
f=[];ans=1<<60
for i in range(n):
    q,w=a[i],b[i]
    if q>w:
        q,w=w,q
    c[i]=deque([q,(q+w)//2,w,1<<60])
    d=max(d,q)
    f+=[(q,i),((q+w)//2,i),(w,i)]
f.sort()
for i,j in f:
    ans=min(ans,d-i)
    c[j].popleft()
    d=max(d,c[j][0])
print(ans)