#include <bits/stdc++.h>

using namespace std;

bool check(vector<int> a, vector<int> b) {
  vector<int> s(b.begin(), b.end());
  int n = a.size();
  b.clear();
  b.resize(n, -1);
  sort(s.begin(), s.end());
  for (int i = 0, j = 0; i < n; i++) {
    if (b[i] == -1) {
      b[i] = s[j++];
      if (i + 2 < n && b[i + 2] == -1) b[i + 2] = s[j++];
    }
  }
  sort(a.begin(), a.end());
  a.push_back(a[0]);
  a.erase(a.begin());
  for (int i = 1; i < n - 1; i++) {
    if (a[i] <= b[i - 1] || a[i] <= b[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;
}