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

#define int long long

void solve() {

    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];

    while(a.size() > 1) {

        int best = -1;
        int idx = 0;

        // choose best adjacent pair
        for(int i=0;i<a.size()-1;i++) {

            vector<int> v = {
                a[i],
                a[i+1],
                b[i],
                b[i+1]
            };

            sort(v.begin(), v.end());

            int cur = min(v[1], v[2]);

            if(cur > best) {
                best = cur;
                idx = i;
            }
        }

        vector<int> v = {
            a[idx],
            a[idx+1],
            b[idx],
            b[idx+1]
        };

        sort(v.begin(), v.end());

        a[idx] = v[1];
        b[idx] = v[2];

        a.erase(a.begin() + idx + 1);
        b.erase(b.begin() + idx + 1);
    }

    cout << min(a[0], b[0]) << endl;
}

int32_t main() {

    int t;
    cin >> t;

    while(t--) {
        solve();
    }
}