//g++ 2.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;

#define fi first
#define se second
#define pb push_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

void solve(){
  int n;
  cin>>n;

  vi a(2*n);
  rep(i,0,2*n){
    cin>>a[i];
    a[i]--;
  }

  int flag=1;
  rep(i,0,2*n){
    if(a[i]!=i%n){
      flag=0;
    }
  }

  if(flag==1){
    cout<<"Yes\n";
    return;
  }

  rep(i,0,n){
    vi b(2*n);
    rep(j,0,n){
      b[j]=j;
      b[n+j]=j;
    }

    
    rep(j,i,i+n+1){
      int p=j,q=2*i+n-j;
      if(p<q){
        swap(b[p],b[q]);
      }
    }

    int flg=1;
    rep(j,0,2*n){
      if(a[j]!=b[j]){
        flg=0;
      }
    }

    if(flg==1){
      cout<<"Yes\n";
      return;
    }
  }

  cout<<"No\n";
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  cin>>t;

  while(t--){
    solve();
  }
}