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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;

    vector<array<int, 3>> a(n);
    vector<int> b(n * 3);
    for (int i = 0; i < n; i++) {
        cin >> a[i][0];
    }
    for (int i = 0; i < n; i++) {
        cin >> a[i][2];
        if (a[i][0] > a[i][2]) swap(a[i][0], a[i][2]);
        a[i][1] = (a[i][0] + a[i][2]) / 2;
        for (int h = 0; h < 3; h++) {
            b[i * 3 + h] = a[i][h];
        }
    }
    sort(b.begin(), b.end());

    vector<int> c(n, 0);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq;
    int a1 = 0;
    for (int i = 0; i < n; i++) {
        a1 = max(a1, a[i][0]);
        pq.push({ a[i][0], i });
    }
    int r = a1 - b[0];
    //cout << a1 << ' ' << b[0] << endl;

    for (const auto &a0 : b) {
        while (pq.top().first < a0) {
            auto [_, i] = pq.top(); pq.pop();
            if (c[i] == 2) {
                cout << r << endl;
                exit(0);
            }
            int t = a[i][++c[i]];
            a1 = max(a1, t);
            pq.push({ t, i });
        }
        r = min(r, a1 - a0);
    }
    cout << r << endl;

    return 0;
}