#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
#define ll long long
#define lll __int128
#define ull unsigned long long
#define ld long double
#define PI acos(-1.0)
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define maxn 500005
#define mod 1000000007
#define inf 1000000007
#define pii pair<ll,ll>
#define vii vector<pii>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define lcm(a,b) ((a*b)/__gcd(a,b));
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define setbits(x) __builtin_popcountll(x)
#define rep(i, a, b) for(ll i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define rev_str(str) reverse(str.begin(),str.end());
#define print(v) for(auto e:v) cout<<e<<" "; cout<<endl;
#define sum(a) (accumulate((a).begin(), (a).end(), 0LL))
#define printp(v) for(auto e:v) cout<<e.first<<" "<<e.second<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
bool sortByValue(const pair<int, int>& a, const pair<int, int>& b) {return a.second > b.second;}
const int N = 1e5+7;

void solve(ll t) {
    ll n;cin>>n;
    vi p(n),q(n);
    rep(i,0,n) cin>>p[i];
    rep(i,0,n) cin>>q[i];
    if(n==1){
        cout<<"Yes"<<endl;return;
    }
    srt(p);
    srt(q);
    bool  ok = true;
    for(int i = 0;i<n-1;i++){
        ll ki = p[i];
        ll ji = q[i];
        ll nts = q[i+1];
        if(ki>ji && ki>nts){
            continue;
        }
        else{
            ok = false;
        }
    }
    if(ok){
        cout<<"Yes"<<endl;return;
    }
    ok = true;
    for(int i = 0;i<n-1;i++){
        ll ki = q[i];
        ll ji = p[i];
        ll nts = p[i+1];
        if(ki>ji && ki>nts){
            continue;
        }
        else{
            ok = false;
        }
    }
    if(ok){
        cout<<"Yes"<<endl;
    }
    else{
        cout<<"No"<<endl;
    }
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll t=1;cin>>t;
    for(int i=1;i<=t;i++){
        solve(i);
    }
    return 0;
}