#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false); 
    
    int n;
    cin>>n;
    vector<int> a(n),b(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    for(int i = 0;i<n;i++) cin>>b[i];
    vector<pair<int,int>> use;
    for(int i = 0;i<n;i++){
        use.push_back(make_pair(a[i],i));
        use.push_back(make_pair(b[i],i));
        use.push_back(make_pair((a[i]+b[i])/2,i));
    }
    int cnt = 0;
    vector<int> now(n,0);
    int ans = 1e9;
    sort(use.begin(),use.end());
    int l = 0,r = 0;
    while(l<use.size()){
        while(l>=r){
            int ni = use[r].second;
            now[ni]++;
            if(now[ni]==1) cnt++;
            r++;
        }
        while(cnt!=n&&r<use.size()){
            int ni = use[r].second;
            now[ni]++;
            if(now[ni]==1) cnt++;
            r++;
        }
        if(cnt==n){
            ans = min(ans,use[r-1].first-use[l].first);
        }
        int ni = use[l].second;
        now[ni]--;
        if(now[ni]==0) cnt--;
        l++;
    }
    cout<<ans<<endl;
}