#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int aps(int n) {
    return n < 0 ? -n : n;
}

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for(int &x : a) cin >> x;

    int m;
    cin >> m;
    vector<int> b(m);
    for(int &x : b) cin >> x;

    sort(begin(a), end(a));
    sort(begin(b), end(b));

    int i = 0;
    int j = 0;

    int min_razl = aps(a[0]-b[0]);
    while(i < n && j < m) {
        int razl = aps(a[i] - b[j]);
        if(razl < min_razl) min_razl = razl;

        if(a[i] < b[j]) i++;
        else j++;
    }

    cout << min_razl << endl;
}