#include<bits/stdc++.h>
#define ll long long 
#define py cout<<"Yes"<<endl
#define pn cout<<"No"<<endl
#define pe cout<<endl
#define av vector<int>a(n)
#define ai for(auto &i:a)cin>>i
#define ao for(auto i:a)cout<<i<<" " 
#define mod 1000000007
using namespace std; 

bool prime(int n)
{
    if(n<2) return false;
    if(n<=3) return true;
    if(n%2==0) return false; 
    for(int i=3; i*i<=n; i+=2)
        if(n%i==0) return false;
    return true;
}

ll bigmod(ll b,ll p)
{
 if(p==0)   return 1;
 ll x=bigmod(b,p/2);
 x=(x*x)%mod;
 if(p%2==1) x=(x*b)%mod;
 return x;
}

vector<int>adj[200005];
int vis[200005];
void DFS(int node)
{
    vis[node]=1;
    for(ll i=0; i<adj[node].size(); i++)
    {
        if(vis[adj[node][i]]==0) 
          DFS(adj[node][i]);
    }
}

int main()
{
    ios_base::sync_with_stdio(0);   cin.tie(0);     cout.tie(0);
    ll t;   cin>>t; 
    while(t--)
    {
      ll n;   cin>>n; 
      ll a[n],b[n];
      for(ll i=0; i<n; i++)  cin>>a[i];
      for(ll i=0; i<n; i++)  cin>>b[i];

      sort(a,a+n);
      sort(b,b+n);
      ll f=0;
      for(ll i=1; i<n-1; i++)
      {
        if(b[i]>a[i-1] && b[i]>a[i+1]) continue;
        else f=1;
      }
      if(f==0)  {py;continue;}

      f=0;
      for(ll i=1; i<n-1; i++)
      {
        if(a[i]>b[i-1] && a[i]>b[i+1]) continue;
        else f=1;
      }
      if(f==0)  {py;continue;}

      reverse(a,a+n);
      f=0;
      for(ll i=1; i<n-1; i++)
      {
        if(b[i]>a[i-1] && b[i]>a[i+1]) continue;
        else f=1;
      }
      if(f==0)  {py;continue;}

      f=0;
      for(ll i=1; i<n-1; i++)
      {
        if(a[i]>b[i-1] && a[i]>b[i+1]) continue;
        else f=1;
      }
      if(f==0)  {py;continue;}

      pn;
    }
    
}