#include <bits/stdc++.h>
using namespace std;

int t, n;
int a[2000];

bool ck(int a[]) {
	for (int i = 0; i < n; i++)
		if (a[i] != i + 1 || a[i + n] != i + 1)
			return false;

	return true;
}

int main()
{
	cin >> t;

	for (int i = 0; i < t; i++) {
		cin >> n;

		for (int j = 0; j < n * 2; j++)
			cin >> a[j];

		bool f = ck(a);

		if (!f) {
			for (int j = 0; j < n; j++) {
				if (a[j] == j + 1 && a[j + 1] != (j + 1) % n + 1) {
					int b[2000];

					for (int k = 0; k < n * 2; k++) {
						if (k <= j || k >= n + j)
							b[k] = a[k];
						else
							b[k] = a[n + j * 2 - k];
					}

					f = ck(b);
					break;
				}
			}
		}

		if(f)
			cout << "Yes" << endl;
		else
			cout << "No" << endl;
	}
}