#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF 1000000007
#define LINF 1000000000000000007LL
#define PI 3.14159265359
#define P pair<ll,ll>
template <typename T>
inline bool chmax(T &a, const T &b){
  if(a<b) {a=b; return true;}
  else return false;
}
template <typename T>
inline bool chmin(T &a, const T &b){
  if(a>b) {a=b; return true;}
  else return false;
}
struct Edge{
  int to; ll cost;
  Edge(int to, ll cost) : to(to), cost(cost) {}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void add_edge(Graph &g,int from,int to,ll cost,bool rev,ll rev_cost){
  g[from].push_back(Edge(to,cost));
  if(rev) g[to].push_back(Edge(from,rev_cost));
}



void solve(){
  int n;
  cin>>n;
  vector<int> a(2*n);
  rep(i,2*n) cin>>a[i];
  vector<int> b(2*n);
  rep(i,n) b[i]=b[i+n]=i+1;
  bool res=0;
  rep(i,n){
    bool f=1;
    rep(j,2*n){
      if(j<=i || j>=i+n){
        if(a[j]!=b[j]) f=0;
      }else{
        if(a[j]!=b[i+n-(j-i)]) f=0;
      }
    }
    if(f) res=1;
  }
  bool f=1;
  rep(i,2*n){
    if(a[i]!=b[i]) f=0;
  }
  if(f) res=1;
  if(res) cout<<"Yes"<<'\n';
  else cout<<"No"<<'\n';
}

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