#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int tt;
    cin >> tt;
    while(tt--) {
        int n;
        cin >> n;
        VI a(2 * n);
        rep(i, 2 * n) cin >> a[i], a[i]--;
        rep(i, 2 * n - 1) if ((a[i] - a[i + 1] + n) % n == 1) {
            int j = i + 1;
            while(j < 2 * n && a[j] != a[i]) j++;
            if (j == 2 * n) break;
            reverse(a.begin() + i, a.begin() + j + 1);
            break;
        }
        bool ok = true;
        rep(i, n) if (a[i] != i || a[i + n] != i) ok = false;
        cout << (ok ? "Yes\n" : "No\n");
    }
}