#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

void solve(){
    int n; cin >> n;
    vector<int> a(2*n), c(2*n);
    for(int i = 0; i < 2*n; i++) {
        cin >> a[i];
        c[i] = (i%n)+1;
    }
    if(a == c){
        cout << "Yes" << endl;
        return;
    }
    for(int x = 1; x <= n; x++){
        vector<int> b;
        int l = x-1, r = x-1+n;
        for(int i = 0; i < l; i++) b.push_back(c[i]);
        for(int i = r; i >= l; i--) b.push_back(c[i]);
        for(int i = r+1; i < 2*n; i++) b.push_back(c[i]);
        // print_vector(b);
        if(a == b){
            cout << "Yes" << endl;
            return;
        }
    }
    cout << "No" << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) solve();
}