#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int main() {
    int T;
    cin >> T;
    while (T-- > 0) {
        int N;
        cin >> N;
        vector<int> X(2 * N), A(2 * N);
        rep(i, 0, 2 * N) X[i] = i % N + 1;
        rep(i, 0, 2 * N) cin >> A[i];
        string ans = "No\n";
        bool f = true;
        rep(j, 0, 2 * N) f = f && (X[j] == A[j]);
        if (f) ans = "Yes\n";
        rep(i, 0, N) {
            rep(j, 0, (N + 1) / 2) swap(X[i + j], X[N + i - j]);
            f = true;
            //rep(j, 0, 2 * N) cout << X[j] << " "; cout << endl;
            rep(j, 0, 2 * N) f = f && (X[j] == A[j]);
            if (f) ans = "Yes\n";
            rep(j, 0, (N + 1) / 2) swap(X[i + j], X[N + i - j]);
        }
        cout << ans;
    }
}