#include using namespace std; void solve() { int n; cin >> n; vector a(2 * n); for (int i = 0; i < 2 * n; i++) { cin >> a.at(i); } int turn = -1; if (a.at(0) != 1) { puts("No"); return; } for (int i = 0; i < 2 * n - 1; i++) { if (turn == -1 and a.at(i + 1) - a.at(i) != 1) { if (a.at(i + 1) - a.at(i) == -1) { turn = a.at(i); break; } else if (a.at(i + 1) - a.at(i) != -n + 1) { puts("No"); return; } break; } } if (turn == -1) { for (int i = 0; i < 2 * n; i++) { if (a.at(i) != i % n + 1) { puts("No"); return; } } puts("Yes"); return; } int prev = 0, d = 1; for (int i = 0; i < 2 * n; i++) { prev += n + d - 1; prev %= n; prev++; if (a.at(i) != prev) { puts("No"); return; } if (a.at(i) == turn) { d *= -1; } } puts("Yes"); } int main() { int t; cin >> t; for (int i = 0; i < t; i++) { solve(); } return 0; }