#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
//using mint=modint998244353;
bool eq(vector<ll>A,vector<ll>B){
  REP(i,A.size())if(A[i]!=B[i])return 0;return 1;
}
signed main(){
  ll t;cin>>t;
  REP(q,t){
    ll N;cin>>N;
    vector<ll>A(2*N),X(2*N);
    REP(i,2*N)cin>>A[i];
    REP(i,N){X[i]=i+1;X[i+N]=i+1;}
    bool ans=0;
    if(eq(A,X))ans=1;
    REP(i,N){
      reverse(X.begin()+i,X.begin()+i+N+1);
      if(eq(A,X))ans=1;
      reverse(X.begin()+i,X.begin()+i+N+1);
    }
    if(ans)cout<<"Yes"<<endl;else cout<<"No"<<endl;
  }
  return 0;
}