#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		vector<int>a(2 * n);
		rep(i, 2 * n)cin >> a[i], a[i]--;
		{
			bool b = true;
			rep(i, 2 * n)if (a[i] != i % n)b = false;
			if (b) { cout << "Yes" << endl; continue; }
		}
		int idx = -1;
		rep(i, n) {
			if (a[i] == i)idx = i;
			else break;
		}
		if (-1 == idx) { cout << "No" << endl; continue; }
		vector<int>b(2 * n);
		rep(i, idx + 1) {
			b[i] = i;
			b[2 * idx - i] = i;
		}
		rep(i, n - idx) {
			b[2 * idx + 1 + i] = n - i - 1;
			b[2 * n - 1 - i] = n - i - 1;
		}
		//rep(i, 2 * n)cout << b[i] << " ";
		//cout << endl;
		{
			bool ch = true;
			rep(i, 2 * n)if (a[i] != b[i])ch = false;
			if (ch)cout << "Yes" << endl;
			else cout << "No" << endl;
		}
	}
	return 0;
}