#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define reps(i, s, e) for (ll i = s; i <= e; ++i)
#define all(v) v.begin(), v.end()
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
using ll = long long;
using ld = long double;
using cp = complex<ld>;
using pa = pair<ll, ll>;
using tup = tuple<ll, ll, ll>;
using vp = vector<pair<ll, ll>>;
using vtup = vector<tuple<ll, ll, ll>>;
using st = string;
using vs = vector<string>;
using vc = vector<char>;
using vvi = vector<vector<ll>>;
using vvc = vector<vector<char>>;
using vi = vector<ll>;
const ll MOD1 = 1000000007;
const ll MOD2 = 998244353;
const ll INF = (1LL << 60);

void solve() {
  ll n;
  cin >> n;
  vi a(n * 2);
  vi x(n * 2);
  rep(i, n * 2) cin >> a[i];
  rep(i, n * 2) x[i] = i % n + 1;

  vi t = x;
  bool ok = true;

  rep(i, n * 2) if (a[i] != x[i]) ok = false;

  if (ok) {
    cout << "Yes" << endl;
    return;
  }

  rep(i, n) {
    x = t;
    reverse(x.begin() + i + 1, x.begin() + n + i);
    ok = true;
    rep(j, n * 2) {
      if (a[j] != x[j]) ok = false;
    }
    if (ok) {
      cout << "Yes" << endl;
      return;
    }
  }
  cout << "No" << endl;
}

int main() {
  ll t;
  cin >> t;

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