/* 
 *   @author:- MAHMUDUL HASAN SAKIB
 *   DATE & TIME :- 2025-06-13 21:39:28
 *   BANGLADESH , SYLHET.
 */ 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define fi first
#define se second
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#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+10;
bool cmp(const pair<ll,ll>& a,const pair<ll,ll>&b){
    if(a.first != b.first) return a.first>b.first;
    return a.second<b.second;
}

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

int main() {
    fast
    ll t = 1;cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}