#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using V = vector<ll>;
using VV = vector<V>;
using VS = vector<string>;
using P = pair<ll,ll>;
using M = map<ll,ll>;
using Q = queue<ll>;
using PQ = priority_queue<ll>;
using PQG = priority_queue<ll,V,greater<ll>>;
using S = set<ll>;
const ll MOD = 1000000007;
const ll Mod = 998244353;
const ll INF = 1LL << 60;
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep2(i,s,n) for(int i = s; i < n; i++)
#define rep3(i,s,n) for(int i = s; i <= n; i++)
#define all(x) (x).begin(),(x).end()
#define MP(a,b) make_pair(a,b)
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
template<class T>void Vin(vector<T>&a){rep(i,(int)a.size())cin>>a[i];}
template<class T>void Vout(const vector<T>&a){rep(i,(int)a.size())cout<<a[i]<<endl;}
ll power(ll a,ll b,const ll&M){a%=M;ll res=1;while(b>0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;}
const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0};

int main() {
  ll t;
  cin >> t;
  rep(i,t) {
    ll n;
    cin >> n;
    V a(2*n);
    Vin(a);
    if(n == 1) {
      if(a[0] == 1 && a[1] == 1) cout << "Yes" << endl;
      else cout << "No" << endl;
      continue;
    }
    if(n == 2) {
      if (a[0] == 1 && a[1] == 2 && a[2] == 1 && a[3] == 2) cout << "Yes" << endl;
      else cout << "No" << endl;
      continue;
    }
    VV b(n+1,V(n+1));
    rep(j,2*n) {
      if(j == 0) b[a[j+1]][a[j]]++;
      else if(j == 2*n-1) b[a[j-1]][a[j]]++;
      else {
        b[a[j-1]][a[j]]++;
        b[a[j+1]][a[j]]++;
      }
    }
    bool frag = (a[0] == 1);
    rep2(j,1,n+1) {
      ll l = 1, r = 1;
      if(j < n) r++;
      if(j > 1) l++;
      if(b[j][j%n+1] != r || b[j][(j+n-2)%n+1] != l) frag = 0;
    }
    if(frag) cout << "Yes" << endl;
    else cout << "No" << endl;
  }
}