#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """# paste here...
# """
# sys.stdin = io.StringIO(_INPUT)

INF = 10**10

YES = 'Yes'
NO = 'No'

def solve(N, A):
    N //= 2
    for i in range(2*N):
        if A[i] != i % N:
            if i == 0:
                return 'No'
            for j in range(i+1, 2*N):
                if A[j] == A[i-1]:
                    if A[j-1] != i % N:
                        return 'No'
                    A = A[:i] + A[j-1:i-1:-1] + A[j:]
            else:
                return 'No'
    return 'Yes'


T0 = int(input())
for _ in range(T0):
    N = int(input())
    A = list(map(int, input().split()))
    print(solve(N//2, A))