#include #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template inline int ssize(const T &a) { return (int) a.size(); } template inline std::ostream &print_one(const T &x, char endc) { if constexpr (std::is_same_v) { return std::cout << (x ? "Yes" : "No") << endc; } else { return std::cout << x << endc; } } template inline std::ostream &print(const T &x) { return print_one(x, '\n'); } template std::ostream &print(const T &head, Ts... tail) { return print_one(head, ' '), print(tail...); } inline std::ostream &print() { return std::cout << '\n'; } template std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template struct is_iterable : std::false_type {}; template struct is_iterable())), decltype(std::end(std::declval()))>> : std::true_type { }; template::value && !std::is_same::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } struct VersatileInput { template operator T() const { T x; std::cin >> x; return x; } struct Sized { std::size_t n; template operator T() const { T x(n); for (auto &e: x) std::cin >> e; return x; } }; Sized operator()(std::size_t n) const { return {n}; } } const in; inline void check(bool cond, const char *message = "!ERROR!") { if (not cond) throw std::runtime_error(message); } #ifdef MY_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #define cerr if(false)std::cerr #endif using namespace std; auto solve() { const int n = in; const int n2 = n * 2; vector a = in(n2); auto sa = a; sort(ALL(sa)); vector ini(n2); REP(i, n) ini[i] = ini[i + n] = i + 1; auto sini = ini; sort(ALL(sini)); DUMP(ini); DUMP(sa); if (a == ini) return true; if (sa != sini) return false; if (a[0] != 1 or a.back() != n) return false; for (int i = 0; i < n; ++i) { int r = i + n; auto x = ini; reverse(x.begin() + i, x.begin() + (i + n + 1)); if (x == a) return true; } return false; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << std::fixed << std::setprecision(18); const int T = in; REP(t, T) { auto ans = solve(); print(ans); } }