import sys
sys.setrecursionlimit(10**9)

T = int(input())

def dfs(Z,n,N):

    if n == N+1:
        if all(Z[i-1]==Z[i+N-1]==i for i in range(1,N+1)):
            return True
        else:
            return False
        
    if Z[n-1] != n:
        False
        
    tmp = []    
    for i in range(2*N):
        if Z[i] == n:
            tmp.append(i)

    l,r = tmp
    ret1 = dfs(Z,n+1,N)
    Z[l:r+1] = Z[l:r+1][::-1]
    ret2 = dfs(Z,n+1,N)
    Z[l:r+1] = Z[l:r+1][::-1]

    return ret1 or ret2


for _ in range(T):
    N = int(input())
    A = list(map(int, input().split()))

    if dfs(A,1,N):
        print("Yes")
    else:
        print("No")