#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <algorithm>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <string>
using namespace std;

bool rcmp(int a, int b) { return a>b; }
typedef long long LL;
typedef struct { int h, i; }RNode;
int as[200004];
int bs[200004];
int cs[200004];
class mypcmp {
public:
    bool operator()(const RNode& a, const RNode& b) {
        return a.h<b.h;
    }
};


#define INF 0x7fffffff
int main() {
    int n, i, h, mh, r, valid, t;
    scanf("%d", &n);
    for (i=0; i<n; i++) scanf("%d", &as[i]);
    for (i=0; i<n; i++) scanf("%d", &bs[i]);
    set<int> hs;
    for (i=0; i<n; i++) {
        if (as[i]>bs[i]) { t=as[i]; as[i]=bs[i]; bs[i]=t; }
        cs[i]=(as[i]+bs[i])/2;
        hs.insert(as[i]);
        hs.insert(bs[i]);
        hs.insert(cs[i]);
    }
    priority_queue<RNode, vector<RNode>, mypcmp> q;
    r = INF;
    mh= INF;
    for (i=0; i<n; i++) {
        q.push({bs[i], i});
        mh=min(mh, bs[i]);
    }
    for (auto it = hs.rbegin(); it!=hs.rend(); it++) {
        h = *it;
        valid=1;
        while(!q.empty()) {
            auto x = q.top();
            if (x.h>h) {
                q.pop();
                i=x.i;
                if (cs[i]<=h) {
                    q.push({cs[i], i});
                    mh = min(mh, cs[i]);
                } else if (as[i]<=h) {
                    q.push({as[i], i});
                    mh = min(mh, as[i]);
                } else {
                    valid=0;
                    break;
                }
            } else break;
        }
        if (valid==0) break;
        r = min(r, h-mh);
    }
    printf("%d\n", r);

    return 0;
}