#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)



void slove(){
    int n;
    cin >> n;
    vector<int> x(2*n);
    rep(i,2*n){
      x[i] = (i%n)+1;
    }
    vector<int> a(2*n);
    rep(i,2*n) cin >> a[i];
    bool can = true;
    for (int j = 0; j < 2*n;j++){
        if (a[j] != x[j]){
          can = false;
          break;
        }
    }
    if (can){
      cout << "Yes" << endl;
      return;
    }
    for (int i = 0; i < n;i++){
      can = true;
      reverse(x.begin()+i+1,x.begin()+i+n);
      for (int j = 0; j < 2*n;j++){
        if (a[j] != x[j]){
          can = false;
          break;
        }
      }
      if (can){
        cout << "Yes" << endl;
        return;
      }
      reverse(x.begin()+i+1,x.begin()+i+n);
    } 
    cout << "No" << endl;
}
int main(){
  int tt = 1;
  cin >> tt;
  while(tt--){
   slove();
  }
  return 0;
}