#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int T; cin >> T;
    rep(_,T) {
        int N; cin >> N;
        vector<int> A(2 * N + 1, 0);
        rep(i,2*N) cin >> A[i + 1];
        vector<int> X(2 * N + 1, 0);
        rep(i,N) X[i + 1] = X[i + N + 1] = i + 1;

        int ok = (A == X);
        for(int i = 1; i <= N; i++) {
            reverse(X.begin() + i, X.begin() + i + N + 1);
            ok |= (A == X);
            reverse(X.begin() + i, X.begin() + i + N + 1);
        }
        cout << (ok ? "Yes" : "No") << "\n";
    }
}