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

#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 42
#endif

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

    sort(a.rbegin(), a.rend());
    sort(b.begin(), b.end());

    for (int i = n - 1; i >= 1; i--) swap(a[i], a[i - 1]);
    for (int i = 0; i < n - 1; i++) swap(b[i], b[i + 1]);

    for (int i = 1; i < n - 1; i++) {
        if (a[i] > max(b[i - 1], b[i + 1]) || b[i] > max(a[i - 1], a[i + 1])) {

        }
        else {
            cout << "No\n";
            return;
        }
    }
    cout << "Yes\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

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

    return 0;
}