#include <bits/stdc++.h>

using namespace std;

bool check(vector<int> a, vector<int> b) {
  sort(a.begin(), a.end());
  sort(b.rbegin(), b.rend());
  int n = a.size();
  vector<int> nb(n);
  int l = 0, r = 1;
  while (l < n && r < n) {
    nb[l] = b.back(); b.pop_back();
    l += 2;
    if (l < n) nb[l] = b.back(), b.pop_back(), l += 2;
    nb[r] = b.back(); b.pop_back();
    r += 2;
    if (r < n) nb[r] = b.back(), b.pop_back(), r += 2;
  }
  a.erase(a.begin());
  for (int i = 1; i < a.size(); i++) {
    if (a[i] <= nb[i + 1]) {
      return false;
    }
  }
  return true;
}

void solve(int cs) {
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  for (auto &i : a) cin >> i;
  for (auto &i : b) cin >> i;

  cout << ((check(a, b) || check(b, a)) ? "Yes\n" : "No\n");
}

int32_t main() {
  cin.tie(0) -> sync_with_stdio(0);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve(i);
  }
  return 0;
}