#include <bits/stdc++.h>

using namespace std;

int difMin;

struct Matching
{
    int m, n;
    vector<int> l, r;
    vector<bool> vis, ok;
    vector<vector<pair<int,int>>> adj;

    Matching(int m, int n) : m(m), n(n), l(n), r(m), vis(m), ok(m), adj(m) {}

    void addEdge(int x, int y, int c)
    {
        adj[x].push_back({y,c});
    }

    void sorteaza()
    {
        for (int i=1;i<m;i++)
            sort(adj[i].begin(), adj[i].end(), [](pair<int,int> a, pair<int,int> b) {
                return a.second > b.second;
            });
    }

    bool pairUp(int v)
    {
        if(vis[v]) return false;
        vis[v] = true;

        for(auto u : adj[v])
        {
            if (u.second < difMin)
                break;
            if(l[u.first] == -1) return l[u.first] = v, r[v] = u.first, true;
        }

        for(auto u : adj[v])
        {
            if (u.second < difMin)
                break;
            if(pairUp(l[u.first])) return l[u.first] = v, r[v] = u.first, true;
        }

        return false;
    }

    int matching()
    {
        int sz;
        bool changed;

        l.assign(n, -1);
        r.assign(m, -1);

        for(sz=0, changed=true; changed; )
        {
            vis.assign(m, false);
            changed = false;

            for(int i=0; i<m; i++)
                if(r[i] == -1 && pairUp(i)) ++sz, changed = true;
        }

        return sz;
    }
};

int t, n;

int a[10005];
int b[10005];

Matching g = Matching(1, 1);

bool ok(int minDif)
{
    difMin = minDif;

    //cout<<"match is "<<match()<<'\n';
    return g.matching() == n;
}


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

    cin>>t;
    while(t)
    {
        t--;

        cin>>n;

        for(int i=1;i<=n;i++)
            cin>>a[i];

        for(int i=1;i<=n;i++)
            cin>>b[i];

        g = Matching(n+1, n+1);

        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
            {
                g.addEdge(i, j, abs(a[i]-b[j]));
            }

        g.sorteaza();

        int st=0, dr=1e9, mij, last = 0;

        while(st <= dr)
        {
            mij = (st+dr)/2;

            if( ok(mij) )
            {
                last = mij;
                st = mij+1;
            }

            else
                dr = mij-1;
        }

        cout<<last<<'\n';
    }
    return 0;
}