#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#else
#define dbg(x) (x)
#endif

template <typename T> inline bool kado(T a, T b, T c) noexcept {
    if (a == b or b == c or a == c) return false;
    if (a < b and b > c) return true;
    if (a > b and b < c) return true;
    return false;
}

bool solve()
{
    int N;
    cin >> N;
    vector<int> A(N);
    for (auto &a : A) cin >> a;
    vector<int> bads, cs;
    FOR(i, 1, N - 1) {
        if (!kado(A[i - 1], A[i], A[i + 1])) {
            bads.push_back(i);
            cs.push_back(i - 1);
            cs.push_back(i);
            cs.push_back(i + 1);
            if (bads.size() > 6u) return false;
        }
    }
    cs = sort_unique(cs);

    auto chk = [&](const vector<int> &v) -> bool {
        for (auto k : v) {
            if (k and k + 1 < N and !kado(A[k - 1], A[k], A[k + 1])) return false;
        }
        return true;
    };

    if (bads.size() == 6) {
        swap(A[bads[1]], A[bads[4]]);
        return chk(bads);
    }

    FOR(i, max(0, bads.front() - 1), min(N, bads.front() + 2)) {
        FOR(j, max(0, bads.back() - 1), min(N, bads.back() + 2)) {
            if (i != j) {
                vector<int> cands = cs;
                cands.push_back(i - 1);
                cands.push_back(i + 1);
                cands.push_back(j - 1);
                cands.push_back(j + 1);
                cands = sort_unique(cands);
                swap(A[i], A[j]);
                if (chk(cands)) return true;
                swap(A[i], A[j]);
            }
        }
    }
    if (bads.back() - bads.front() >= 3) return false;

    for (auto i : cs) {
        REP(j, N) {
            swap(A[i], A[j]);
            if (chk(cs)) {
                bool ok = true;
                if (j and j + 1 < N and !kado(A[j - 1], A[j], A[j + 1])) ok = false;
                if (j >= 2 and !kado(A[j - 2], A[j - 1], A[j])) ok = false;
                if (j + 2 < N and !kado(A[j], A[j + 1], A[j + 2])) ok = false;
                if (i >= 2 and !kado(A[i - 2], A[i - 1], A[i])) ok = false;
                if (i + 2 < N and !kado(A[i], A[i + 1], A[i + 2])) ok = false;
                if (ok) return true;
            }
            swap(A[i], A[j]);
        }
    }
    return false;
}

int main() {
    int T;
    cin >> T;
    while (T--) cout << (solve() ? "Yes" : "No") << '\n';
}