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

void solve()
{
    int n;
    cin >> n;
    vector<int> a(2 * n);
    for (int i = 0; i < 2 * n; i++)
    {
        cin >> a.at(i);
        a.at(i)--;
    }
    int turn = -1;
    if (a.at(0) != 0)
    {
        puts("No");
        return;
    }
    for (int i = 0; i < 2 * n - 1; i++)
    {
        if (a.at(i + 1) - a.at(i) != 1)
        {
            if (i != n - 1 or a.at(i + 1) != 0)
            {
                turn = a.at(i);
            }
            break;
        }
    }
    if (turn == -1)
    {
        for (int i = 0; i < 2 * n; i++)
        {
            if (a.at(i) != i % n)
            {
                puts("No");
                return;
            }
        }
        puts("Yes");
        return;
    }
    int prev = -1, d = 1;
    for (int i = 0; i < 2 * n; i++)
    {
        prev += n + d;
        prev %= n;
        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;
}