#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

int main(){
    int N; cin >> N;
    vector<i64> A(N); rep(i,N) cin >> A[i];
    vector<i64> B(N); rep(i,N) cin >> B[i];
    rep(i,N) if(A[i] > B[i]) swap(A[i], B[i]);
    vector<pair<i64,i64>> Que(N*3);
    i64 preservedMax = 0;
    rep(i,N){
        preservedMax = max(preservedMax, A[i]);
        Que[i*3+0] = { A[i], (A[i] + B[i]) / 2 };
        Que[i*3+1] = { (A[i] + B[i]) / 2, B[i] };
        Que[i*3+2] = { B[i], INF };
    }
    sort(Que.begin(), Que.end());
    i64 ans = INF;
    for(auto [a,b] : Que){
        ans = min(ans, preservedMax - a);
        preservedMax = max(preservedMax, b);
    }
    cout << ans << endl;
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;