#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=2e9+1;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
void solve(){
  ll n;cin >> n;
  vl x(n*2);
  rep(i,n*2)cin >> x[i],x[i]--;
  vl v(n*2);
  rep(i,n*2)v[i]=i%n;
  if(v==x){
    cout << "Yes" << endl;
    return;
  }
  rep(i,n){
    if(x[i]-1==x[i+1]){
      //rep(j,n*2)cout << v[j] <<" ";cout << endl;
      reverse(v.begin()+i,v.begin()+i+n+1);
      //cout << i << endl;
      //rep(j,n*2)cout << v[j] <<" ";cout << endl;
      if(v==x)cout << "Yes" << endl;
      else cout << "No" << endl;
      return;
    }
  }
  cout << "No" << endl;
}
int main(){
  ll t;cin >> t;
  while(t--)solve();
}