/*
 *Copyright (c) Swadheen Islam Robi (SIR01)
 *Created on Fri Jun 13 2025 8:30:16 PM
 */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pie 2*(acos(0.0))
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define pb push_back
#define endl "\n"
#define lcm(a,b) (a*b)/(__gcd<ll>(a,b))
#define mod 1000000007
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define ALLAHU_AKBAR ios::sync_with_stdio(false); cin.tie(nullptr);

bool val(const vector<ll>& A, const vector<ll>& B) {
    ll n = A.size();
    for (ll i = 1; i < n - 1; ++i) {
        if (!((A[i] > B[i - 1] && A[i] > B[i + 1]) || (B[i] > A[i - 1] && B[i] > A[i + 1]))) {
            return false;
        }
    }
    return true;
}

void sir33() {
    ll n; cin >> n;
    vector<ll> a(n), b(n);
    for (auto &e : a) cin >> e;
    for (auto &d : b) cin >> d;

    if (n <= 2) {
        yes;
        return;
    }

    vector<ll> A = a, B = b;
    srt(A); srt(B);

    vector<ll> aa(n), bb(n);
    ll l = 0, r = n-1;
    for (ll i =0; i<n; ++i) {
        if (i%2 == 0) aa[i] = A[l++];
        else aa[i] = A[r--];
    }

    l = 0, r = n-1;
    for (ll i = 0; i < n; ++i) {
        if (i % 2 == 0) bb[i] = B[l++];
        else bb[i] = B[r--];
    }

    if (val(aa,bb)||val(bb,aa)) {
        yes;
        return;
    }

    no;
}

int main() {
    ALLAHU_AKBAR
    ll t;
    cin >> t;
    while (t--) {
        sir33();
    }
    return 0;
}