#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define test int t;cin>>t;while(t--)
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define F first
#define S second
#define yes cout<<"Yes"<<'\n';
#define no cout<<"No"<<'\n';
#define endl "\n"
#define all(v) v.begin(),v.end()
#define print(v) for(auto it:v) cout<<it<<" "; cout<<endl;
#define print2(pr) for(int i=pr.size()-1;i>=0;i--)cout<<pr[i];cout<<endl;
#define srt(v) sort(v.begin(),v.end());
#define rsrt(v) sort(v.rbegin(),v.rend());
#define rvs(v) reverse(v.begin(),v.end());
#define cinv(v) for(auto &it:v)cin>>it;
#define rall(v) v.rbegin(),v.rend()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define PI 2*acos(0.0)
#define pr pair<int,int>
#define Tasrik ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);

void abrakadabra()
{
    ll n;
    cin>>n;
    vl ar(n),br(n);
    for(int i=0; i<n; i++)
        cin>>ar[i];
    for(int i=0; i<n; i++)
        cin>>br[i];

    srt(ar);
    rsrt(br);

    vl B(n);
    B[0]=br[n-1];
    for(int i=1; i<n; i++)
    {
        B[i]=br[i-1];
    }

    ll f=0,f2=0;
    for(int i=1; i<n-1; i++)
    {
        if(B[i]>ar[i-1]  && B[i]>ar[i+1])
            continue;
        else
            f=1;
    }

    rsrt(ar);
    srt(br);

    vl A(n);
    A[0]=ar[n-1];
    for(int i=1; i<n; i++)
    {
        A[i]=ar[i-1];
    }
    for(int i=1; i<n-1; i++)
    {
        if(A[i]>br[i-1]  && A[i]>br[i+1])
            continue;
        else
            f2=1;
    }

    if(f==0 || f2==0)
        yes
        else
            no


        }

int main ()
{
    Tasrik;
    int cs=1;
    test
    {
//        cout << "Case " <<cs << ": ";
//        cs++;
        abrakadabra();
    }

    return 0;
}