#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

bool solve() {
    int N;
    cin >> N;
    vector<int> A(N * 2);
    for (auto &x : A) cin >> x;
    vector<int> X(N * 2);
    for (int i = 0; i < N; ++i) X[i] = X[N + i] = i + 1;

    if (A == X) return true;
    for (int t = 0; t < N; ++t) {
        std::reverse(X.begin() + t + 1, X.begin() + t + N);
        if (X == A) return true;
        std::reverse(X.begin() + t + 1, X.begin() + t + N);
    }
    return false;
}

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while (T--) cout << (solve() ? "Yes" : "No") << '\n';
}