#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(int argc, char **arhv)
{
    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];
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    vector<int> diff(n, 1000000000);
    int maxx = 0;
    for (int i = 0; i < a.size(); i++) {
        for (int j = 0; j < b.size(); j++) {
            diff[i] = min(diff[i], abs(a[i]-b[j]));
            //cout << diff[i][j] << "\t" ;
        }
        maxx = max(diff[i], maxx);
        //cout << endl;
    }
    cout << maxx << endl;
   // минимум по строке, максимум во всех строках


    /*while (a.size() != 1) {
        int maxx = 0;
        int minn = 1000000000;
        int indx;
        int indy;
        for (int i = 0; i < a.size(); i++) {
            for (int j = 0; j < b.size(); j++) {
                int ad = abs(a[i]-b[j]);

                if (minn > ad) {
                    minn = ad;
                    indx = i;
                }
            }
        }
        a.erase(a.begin() + indx);

        for (int i = 0; i < a.size(); i++) {
            for (int j = 0; j < b.size(); j++) {
                int ad = abs(a[i]-b[j]);
                if (maxx < ad) {
                    maxx = ad;
                    indy = j;
                }
            }
        }

        b.erase(b.begin() + indy);

    }*/
}