#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>
#define LP pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
template<class T>
void chmax(T& a, T b) { a = max(a, b); };
template<class T>
void chmin(T& a, T b) { a = min(a, b); };

int main() {
  int t;
  cin >> t;
  rep(ti,t) {
    int n;
    cin >> n;
    vector<int> a(2*n);
    rep(i,2*n) cin >> a[i];
    vector<int> s(2*n);
    rep(i,n) {
      s[i] = i+1, s[n+i] = s[i];
    }
    
    auto rev = [&](int j , vector<int> x, vector<int> st) {
      reverse(st.begin()+j, st.begin()+n+j+1);
      rep(k,2*n) if (x[k] != st[k]) return false;
      return true; 
    };

    auto same = [&](vector<int> x, vector<int> st) {
      rep(k,2*n) if (x[k] != st[k]) return false;
      return true;
    };

    auto ok = [&]() {
      if (same(a, s)) return true;
      rep(j,n) if (rev(j, a, s)) return true;
      return false;
    };
    if (ok()) cout << "Yes" << endl;
    else cout << "No" << endl;
  }

  return 0;
}