#!/usr/bin/env python3

import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)

t = int(readline())

def calc(a):
    n = len(a) // 2
    f = [0] * (n + 1)
    for v in a:
        f[v] += 1
    for i in range(1, n + 1):
        if f[i] != 2:
            return False
    if a[0] != 1 or a[2 * n - 1] != n:
        return False
    if n == 1:
        return True
    u = [0] * (n + 1)
    for i in range(2 * n - 1):
        if a[i] == a[i + 1]:
            return False
        c = a[i]
        d = a[i + 1]
        if c > d:
            c, d = d, c
        if c == 1 and d == n:
            u[0] += 1
        else:
            if c + 1 != d:
                return False
            u[c] += 1
    if u[0] != 1:
        return False
    for i in range(1, n):
        if u[i] != 2:
            return False
    return True

for _ in range(t):
    n = int(readline())
    a = list(map(int, readline().split()))
    print('Yes' if calc(a) else 'No')