//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
ll A[600600],B[300300],C[300300];
ll psum[600600],psum2[600600];
ll delta[600600],delta2[600600];
int n;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n+n;i++)
		cin>>A[i];
	for(int i=1;i<=n;i++)
		cin>>B[i];
	for(int i=1;i<=n;i++)
		cin>>C[i];
	sort(B+1,B+n+1);
	sort(C+1,C+n+1);
	ll ans=0x3f3f3f3f3f3f3f3f;
	{
		for(int i=1;i<=n;i++)
			psum[i]=max(psum[i-1],abs(C[i]-A[i]));
		for(int i=n+1;i<=n+n;i++)
			psum2[i]=max(psum2[i-1],abs(B[n+n+1-i]-A[i]));
		ll l=0,r=1e9;
		while(l<r)
		{
			memset(delta,0,sizeof(delta));
			memset(delta2,0,sizeof(delta2));
			ll mid=(l+r)/2;
			int p1=1,p2=0;
			bool flag=0;
			for(int i=1;i<=n;i++)
			{
				while(p1<=n&&A[p1]<B[i]-mid)
					p1++;
				while(p2<n&&A[p2+1]<=B[i]+mid)
					p2++;
				if(p1<=p2)
				{
					delta[max(1,p1-i+1)]++;
					delta[p2-i+2]--;
				}
			}
			p1=n+n+1,p2=n+n;
			for(int i=1;i<=n;i++)
			{
				while(p1>n+1&&A[p1-1]<=C[i]+mid)
					p1--;
				while(p2>n&&A[p2]<C[i]-mid)
					p2--;
				if(p1<=p2)
				{
					delta2[p1+i-n]++;
					delta2[p2+i+1-n]--;
				}
			}
			for(int i=1;i<=n+n;i++)
				delta2[i]+=delta2[i-1];
			for(int i=1;i<=n+n;i++)
				delta[i]+=delta[i-1];
			for(int i=0;i<=n;i++)
				if(delta[n-i+1]==i&&psum2[n+n-i]<=mid&&psum[n-i]<=mid&&delta2[n+n-i+1]==i)
					flag=1;
			if(flag)
				r=mid;
			else
				l=mid+1;
		}
		ans=min(ans,l);
	}
	for(int i=1;i<=n;i++)
		swap(B[i],C[i]);
	{
		for(int i=1;i<=n;i++)
			psum[i]=max(psum[i-1],abs(C[i]-A[i]));
		for(int i=n+1;i<=n+n;i++)
			psum2[i]=max(psum2[i-1],abs(B[n+n+1-i]-A[i]));
		ll l=0,r=1e9;
		while(l<r)
		{
			memset(delta,0,sizeof(delta));
			memset(delta2,0,sizeof(delta2));
			ll mid=(l+r)/2;
			int p1=1,p2=0;
			bool flag=0;
			for(int i=1;i<=n;i++)
			{
				while(p1<=n&&A[p1]<B[i]-mid)
					p1++;
				while(p2<n&&A[p2+1]<=B[i]+mid)
					p2++;
				if(p1<=p2)
				{
					delta[max(1,p1-i+1)]++;
					delta[p2-i+2]--;
				}
			}
			p1=n+n+1,p2=n+n;
			for(int i=1;i<=n;i++)
			{
				while(p1>n+1&&A[p1-1]<=C[i]+mid)
					p1--;
				while(p2>n&&A[p2]<C[i]-mid)
					p2--;
				if(p1<=p2)
				{
					delta2[p1+i-n]++;
					delta2[p2+i+1-n]--;
				}
			}
			for(int i=1;i<=n+n;i++)
				delta2[i]+=delta2[i-1];
			for(int i=1;i<=n+n;i++)
				delta[i]+=delta[i-1];
			for(int i=0;i<=n;i++)
				if(delta[n-i+1]==i&&psum2[n+n-i]<=mid&&psum[n-i]<=mid&&delta2[n+n-i+1]==i)
					flag=1;
			if(flag)
				r=mid;
			else
				l=mid+1;
		}
		ans=min(ans,l);
	}
	cout<<ans<<endl;
	return 0;
}