#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define INF 1000000001LL
#define POT (1LL<<23)
#define INFL 1000000000000000099LL
#define pii pair<ll,ll>
#define ppi pair<pii,ll>
#define pip pair<ll,pii>
#define ppp pair<pii,pii>
#define vi vector<ll>
#define vii vector<pii>
#define vvi vector<vi>
#define al(x) x.begin(),x.end()
#define rev(x) reverse(al(x))
#define X 18
#define FCTCST 7
template<typename T, typename U>
pair<T, U> operator+(const pair<T, U>& a, const pair<T, U>& b) {
return {a.first + b.first, a.second + b.second};
}
template<typename T, typename U>
pair<T, U> operator-(const pair<T, U>& a, const pair<T, U>& b) {
return {a.first - b.first, a.second - b.second};
}
template<typename T, typename U,typename Z>
pair<T, U> operator*(const pair<T, U>& a, const Z& b) {
return {a.first*b, a.second*b};
}
template<typename T, typename U,typename Z>
pair<T, U> operator/(const pair<T, U>& a, const Z& b) {
return {a.first/b, a.second/b};
}
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os<<"{"<<p.ff<<", "<<p.ss<<"}";
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
for (size_t i = 0; i < v.size(); ++i) {
if (i) os << ", ";
os << v[i];
}
os << "}";
return os;
}
template<ll MOD=998244353>
struct mint_t{
ll x;
mint_t(ll y=0){x=y%MOD;if(x<0)x+=MOD;}
mint_t& operator+=(const mint_t& a){if((x+=a.x)>=MOD)x-=MOD;return *this;}
mint_t& operator-=(const mint_t& a){if((x+=MOD-a.x)>=MOD)x-=MOD;return *this;}
mint_t operator+(const mint_t& a)const{mint_t res(*this);return res+=a;}
mint_t operator-(const mint_t& a)const{mint_t res(*this);return res-=a;}
mint_t& operator*=(const mint_t& a){(x*=a.x)%=MOD;return *this;}
mint_t operator*(const mint_t& a)const{mint_t res(*this);return res*=a;}
mint_t fp(ll y)const{
mint_t a=1,b=x;
while(y){
if(y&1)a*=b;
b*=b;
y/=2;
}
return a;
}
mint_t& operator/=(const mint_t& a){(*this)*=a.fp(MOD-2);return *this;}
mint_t operator/(const mint_t& a)const{mint_t res(*this);return res/=a;}
};
#define mint mint_t<>
template<long long MOD>
istream& operator>>(istream& in, mint_t<MOD>& a){
ll x;
in>>x;
a=mint_t<MOD>(x);
return in;
}
template<long long MOD>
istream& operator<<(istream& out, mint_t<MOD>& a){
out<<a.x;
return out;
}
mint fct[FCTCST];
mint bnm(ll a,ll b){
if(b>a || a<0)return 0;
return fct[a]/fct[b]/fct[a-b];
}
vi v4,v3,v1,v2;
ll n,a;
ll il1[600007],il2[600007];
void ch(ll x){
for(ll i=0;i<2*n;i++)il1[i]=0;
ll ak=0;
for(ll i : v1){
ll l1=lower_bound(al(v3),(i-x))-v3.begin(),r1=v3.size()+v4.size()-1-(lower_bound(al(v4),(i-x))-v4.begin());
ll l2=lower_bound(al(v3),(i+x+1))-v3.begin(),r2=v3.size()+v4.size()-1-(lower_bound(al(v4),(i+x+1))-v4.begin());
//cout<<l1<<" "<<r1<<" "<<l2<<" "<<r2<<endl;
if(2*n-(r1-l1+1)<=ak){
il1[0]++;
}
else if(n-(r1-l1+1)<=ak){
//2n-ak<=size
ll l=r1-n+1-(r1-l1+1-(n-ak)),r=l1+(r1-l1+1-(n-ak));
//cout<<l<<" "<<r<<" ";
if(l>=0){
il1[l]++;il1[r+1]--;
}
else{
il1[0]++;il1[r+1]--;il1[l+2*n]++;
}
}
ak++;
if(r2-l2+1<=n-ak){
il1[0]++;
}
else{
ll l=l2+(r2-l2+1-(n-ak));
ll r=r2-n+1-(r2-l2+1-(n-ak));
if(r<0){
il1[l]++;il1[r+2*n+1]--;
}
else{
il1[0]++;
il1[l]++;
il1[r+1]--;
}
}
}
for(ll i=1;i<2*n;i++)il1[i]+=il1[i-1];
// for(ll i=0;i<2*n;i++){
// cout<<il1[i]<<" ";
// }
// cout<<"\n\n";
}
bool chh(ll x){
ch(x);
swap(il1,il2);
swap(v1,v2);
ch(x);
for(ll i=0;i<2*n;i++)if(4*n==il1[i]+il2[(i+n)%(2*n)])return 1;
return 0;
}
void solve(){
cin>>n;
for(ll i=0;i<n;i++){
cin>>a;v3.pb(a);
}
for(ll i=0;i<n;i++){
cin>>a;v4.pb(a);
}
rev(v4);
for(ll i=0;i<n;i++){
cin>>a;v1.pb(a);
}
for(ll i=0;i<n;i++){
cin>>a;v2.pb(a);
}
sort(al(v1));sort(al(v2));
// cout<<chh(2);
// cout<<"\n\n";
// cout<<chh(3);
// return;
ll l=0,r=INF;
while(l!=r){
ll md=(l+r)/2;
if(chh(md))r=md;
else l=md+1;
}
cout<<l;
}
int main(){
fct[0]=1;
for(ll i=1;i<FCTCST;i++)fct[i]=fct[i-1]*i;
ll t=1;
//cin>>t;
for(ll i=1;i<=t;i++){
//cout<<"Case #"<<i<<": ";
solve();
}
}
