#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

void flip(int l, int r, vector<int> &A){
    for (int i=0; i<(r-l+1)/2; i++) swap(A[l+i], A[r-i]);
}

void solve(){
    int N;
    cin >> N;
    vector<int> A(2*N), X(2*N);
    for (int i=0; i<2*N; i++){
        cin >> A[i]; A[i]--;
        X[i] = i%N;
    }
    if (A == X){
        cout << "Yes" << endl;
        return;
    }
    for (int i=0; i<N; i++){
        flip(i, i+N, X);
        if (A == X){
            cout << "Yes" << endl;
            return;
        }
        flip(i, i+N, X);
    }

    cout << "No" << endl;
}

int main(){

    int T;
    cin >> T;
    while(T){
        T--;
        solve();
    }

    return 0;
}