#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353; //1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define db double
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int main(){
	int n;cin>>n;
	vc<int>a(n),b(n); rep(i,n)cin>>a[i]; rep(i,n)cin>>b[i];
	rep(i,n)if(a[i]>b[i])swap(a[i],b[i]);
	vc v(n,vc<int>(3));
	rep(i,n){
		v[i][0]=b[i];
		v[i][1]=(a[i]+b[i])/2;
		v[i][2]=a[i];
	}
	int mn=1e9;
	pque<pp>q;
	rep(i,n)q.push({v[i][0],i});
	rep(i,n)mn=min(mn,v[i][0]);
	int ans=2e9;
	vc<int>now(n,0);
	while(q.size()){
		auto [a,t]=q.top(); q.pop();
		ans=min(ans,a-mn);
		if(now[t]==2)break;
		int x=v[t][now[t]+1]; now[t]++;
		q.push({x,t});
		mn=min(mn,x);
	}
	cout<<ans;
}