#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll T;
    cin >> T;
    while (T--){
        ll N;
        cin >> N;
        vector<ll> A(N);
        rep(i, N){
            cin >> A[i];
        }
        // 隣接の交換ではなかった......
        ll num_k = 0;
        set<ll> st_vac;
        for (ll i = 0; i < N - 2; i++){
            if ((A[i] - A[i + 1]) * (A[i + 1] - A[i + 2]) < 0 && A[i] != A[i + 2]){
                num_k++;
            }
            else{
                st_vac.insert(i);
                st_vac.insert(i + 1);
                st_vac.insert(i + 2);
            }
        }
        vector<ll> vec;
        for (auto it = st_vac.begin(); it != st_vac.end(); it++){
            vec.push_back(*it);
        }
        if (vec.size() >= 20){
            cout << "No" << endl;
            continue;
        }

        bool pos = false;
        // st_vac にある要素は必ず使うことになる
        for (ll i = 0; i < N; i++){
            for (ll j = 0; j < vec.size(); j++){
                if (vec[j] == i) continue;
                if (A[vec[j]] == A[i]) continue;
                set<ll> st_swaps;
                for (ll k = -1; k <= 1; k++){
                    if (i + k >= 1 && i + k < N - 1){
                        st_swaps.insert(i + k);
                    }
                }
                for (ll k = -1; k <= 1; k++){
                    if (vec[j] + k >= 1 && vec[j] + k < N - 1){
                        st_swaps.insert(vec[j] + k);
                    }
                }
                vector<ll> vec_swaps;
                for (auto it = st_swaps.begin(); it != st_swaps.end(); it++){
                    vec_swaps.push_back(*it);
                }

                // debug(vec_swaps);

                for (ll id: vec_swaps){
                    if ((A[id - 1] - A[id]) * (A[id] - A[id + 1]) < 0 && A[id - 1] != A[id + 1]){
                        num_k--;
                    }
                }
                swap(A[i], A[vec[j]]);
                for (ll id: vec_swaps){
                    if ((A[id - 1] - A[id]) * (A[id] - A[id + 1]) < 0 && A[id - 1] != A[id + 1]){
                        num_k++;
                    }
                }
                if (num_k == N - 2) pos = true;
                for (ll id: vec_swaps){
                    if ((A[id - 1] - A[id]) * (A[id] - A[id + 1]) < 0 && A[id - 1] != A[id + 1]){
                        num_k--;
                    }
                }
                swap(A[i], A[vec[j]]);
                for (ll id: vec_swaps){
                    if ((A[id - 1] - A[id]) * (A[id] - A[id + 1]) < 0 && A[id - 1] != A[id + 1]){
                        num_k++;
                    }
                }
            }
        }
        cout << (pos ? "Yes" : "No") << endl;
    }
}