#include <iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main()
{
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> b(n);
    for (int i = 0; i < n; i++)

    {
      cin >> a[i];
    }
    for (int j = 0; j < n; j++) {
      cin >> b[j];
    }
    if (n == 1)
	{
      if(a[0]==b[0])cout << "Yes" << endl;
		else cout<<"No"<<endl;
	}
	else if(n==2)
	{
		sort(a.rbegin(),a.rend());
		sort(b.rbegin(),b.rend());
		if(a[0]>b[1] || b[0]>a[1]) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
    else {
      sort(a.rbegin(), a.rend());
      sort(b.rbegin(), b.rend());
      int flag = 0;
      int count = 0;
      for (int k = 0; k < n - 2; k++) {
        if ((a[k] > b[k] && a[k] > b[k + 2]) ||
            (b[k] > a[k] && b[k] > a[k + 2])) {
          count++;
        } else {
          flag = 1;
          break;
        }
      }
      if (count == n - 2)
        cout << "Yes" << endl;
      else
        cout << "No" << endl;
    }
  }
	return 0;
}