#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
#include <fstream>
using namespace std;
int a[2020], x[2020];
int main() {
	int t;
	cin >> t;
	for (int i = 0; i < t; i++) {
		int n;
		cin >> n;
		for (int j = 0; j < 2 * n; j++) {
			cin >> x[j];
			a[j] = j % n + 1;
		}
		bool bo1 = true;
		for (int k = 0; k < 2 * n; k++) {
			if (a[k] != x[k]) {
				bo1 = false;
			}
		}
		for (int j = 0; j < n; j++) {
			reverse(a + j, a + j + n + 1);
			bool bo = true;
			for (int k = 0; k < 2 * n; k++) {
				if (a[k] != x[k]) {
					bo = false;
				}
			}
			reverse(a + j, a + j + n + 1);
			if (bo) {
				bo1 = true;
				break;
			}
		}
		if (bo1) {
			cout << "Yes" << endl;
		}
		else {
			cout << "No" << endl;
		}
	}
}