#include <bits/stdc++.h>

using namespace std;

bool check2(vector<int> a, vector<int> b) {
  return a.back() > max(b[0], b[1]);
}

bool check(vector<int> a, vector<int> b) {
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  int n = a.size();
  if (n < 3) return true;
  //if (n == 3) return check2(a, b);
  int last = b.back(); b.pop_back();
  int cnt = 0;
  for (int i = n - 1; i >= 2; i -= 2) {
    ++cnt;
  }
  for (int i = n - 1; i > 1; --i, --cnt) {
    if (cnt == 0) {
      last = b.back(); b.pop_back();
    }
    if (b.back() >= a[i]) return false;
    if (last >= a[i]) return false;
    last = b.back();
    b.pop_back();
  }
  assert(b.empty());
  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;
}