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


#define int long long

void iusearchbtw () {
        int n; cin >> n;
        vector<int> a(n);
        vector<int> b(n);
        for (auto &x : a) cin >> x;
        for (auto &x : b) cin >> x;
        vector<int> f(n), s(n);
        sort(a.begin(), a.end());
        sort(b.begin(), b.end());
        int l = 0;
        for (int i = 0; i < n; l++,i += 2) {
                f[i] = a[l];
        }
        for (int i = 1; i < n; l++, i += 2) {
                f[i] = a[l];
        }
        l = 0;
        for (int i = 0; i < n; l++, i += 2) {
                s[i] = b[l];
        }
        for (int i = 1; i < n; l++, i += 2) {
                s[i] = b[l];
        }
        bool ok = 1;
        for (int i = 1; i < n - 1; i++) {
                ok &= ((f[i - 1] < s[i] && s[i] > f[i + 1]) || (s[i - 1] < f[i] && f[i] > s[i + 1])); 
        } 
        cout << (ok ? "Yes\n" : "No\n");
}






signed main () {
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
        int tt = 1;	
        cin >> tt;
	while (tt --> 0) iusearchbtw();
}