#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { 
        std::cin.tie(nullptr); 
        std::ios_base::sync_with_stdio(false); 
        std::cout << std::fixed << std::setprecision(30); 
    } 
} init_io; 
}

template <typename T>
T ceil_pow2(T bound) {
    T ret = 1;
    while (ret < bound) ret *= 2;
    return ret;
}

template <typename T>
T ceil_div(T a, T b) { return a / b + !!(a % b); }


bool solve() {
    ll n;
    std::cin >> n;
    vec<ll> av(n);
    for (ll &e : av) std::cin >> e;

    auto check = [&](ll idx) {
        std::array<ll, 3> c = {{ av[idx], av[idx + 1], av[idx + 2] }};
        if (c[0] == c[1] || c[1] == c[2] || c[2] == c[0]) return false;
        if (c[0] < c[1] && c[2] < c[1]) return true;
        if (c[1] < c[0] && c[1] < c[2]) return true;
        return false;
    };

    vec<bool> ok_a(n);
    ll sum_a = 0;
    vec<ll> idx_a;

    auto add_cand = [&](vec<ll> &v, ll i) {
        for (ll j = 0; j <= 2; j++) if (0 <= i + j && i + j < n) v.push_back(i + j);
    };

    for (ll i = 0; i < n - 2; i++) {
        const bool af = check(i);
        sum_a += af;
        ok_a[i] = af;
        if (!af) add_cand(idx_a, i);
    }

    if (15 < n - 2 - sum_a) return false;

    auto cnt_uniq = [&](vec<ll> &v) {
        std::sort(ALL(v));
        auto ite = std::unique(ALL(v));
        ll dist = std::distance(v.begin(), ite);
        return dist;
    };

    for (ll i1 : idx_a) for (ll i2 = 0; i2 < n; i2++) {
        if (i1 == i2) continue;
        if (av[i1] == av[i2]) continue;
        std::swap(av[i1], av[i2]);
        vec<ll> buf, dbuf;
        for (ll idx : { i1, i2 }) {
            for (ll i = -2; i <= 2; i++) {
                ll nidx = idx + i;
                if (!(0 <= nidx && nidx + 2 < n)) continue;
                const bool f1 = ok_a[nidx], f2 = check(nidx);
                if (f1 && !f2) dbuf.push_back(nidx);
                if (!f1 && f2) buf.push_back(nidx);
            }
        }
        ll tmp = sum_a;
        tmp += cnt_uniq(buf);
        tmp -= cnt_uniq(dbuf);
        if (tmp == n - 2) return true;
        std::swap(av[i1], av[i2]);
    }
    return false;
}

int main() {
    ll t;
    std::cin >> t;
    while (t--) std::cout << (solve() ? "Yes" : "No") << "\n";
    return 0;
}