#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
while (T--){
int n;
cin >> n;
vector<ll> A(n), B(n);
for (int i = 0; i < n; i++) cin >> A[i];
for (int i = 0; i < n; i++) cin >> B[i];
if (n <= 2) {
cout << "YES\n";
continue;
}
auto check = [&](const vector<ll>& X, const vector<ll>& Y) {
priority_queue<ll> pqX(X.begin(), X.end());
priority_queue<ll, vector<ll>, greater<ll>> pqY(Y.begin(), Y.end());
vector<ll> x(n), y(n);
for (int i = 1; i < n-1; i++){
x[i] = pqX.top();
pqX.pop();
}
x[n-1] = pqX.top(); pqX.pop();
x[0] = pqX.top(); pqX.pop();
int idx = 0;
while (!pqY.empty()){
y[idx] = pqY.top();
pqY.pop();
idx += 2;
if (idx >= n) idx = 1;
}
for (int i = 1; i < n-1; i++){
if (!(x[i] > y[i-1] && x[i] > y[i+1]))
return false;
}
return true;
};
cout << (check(A,B) || check(B,A) ? "YES\n" : "NO\n");
}
return 0;
}