#include "bits/stdc++.h"
using namespace std;
#define k(n) begin(n), end(n)

void solve(){
  int n; cin >> n;
  vector<int> a(n), b(n);
  for (auto &e: a) cin >> e;
  for (auto &e: b) cin >> e;
  sort(k(a)), sort(k(b));
  
  int g1 = 1, g2 = 1;
  
  int p = n/2 - 1;
  if (n & 1) p++;

  for (int i = 0; i < p; i++){
    if (a[i + 2] <= b[i] || a[i + 2] <= b[i + 1]) g1 = 0;
    if (b[i + 2] <= a[i] || b[i + 2] <= a[i + 1]) g2 = 0;
  }
  for (int i = p; i < n - 2; i++){
    if (a[i + 2] <= b[i + 1] || a[i + 2] <= b[i + 2]) g1 = 0;
    if (b[i + 2] <= a[i + 1] || b[i + 2] <= a[i + 2]) g2 = 0;
  }
  
  cout << (g1 || g2 ? "Yes\n" : "No\n");
}

int main(){int t; cin >> t; while (t--) solve();}