#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

int n;
vector<int> a;

void solve(){
    cin >> n;a.resize(n);
    rep(i,n) cin >> a[i];
    vector<bool> f(n,false);
    vector<int> ng={};
    rep(i,n-2){
        int ma=max(a[i],max(a[i+1],a[i+2])),mi=min(a[i],min(a[i+1],a[i+2]));
        if(a[i+1]==ma || a[i+1]==mi) continue;
        f[i]=true;f[i+1]=true;f[i+2]=true;
        ng.push_back(i);
    }
    if(ng.size()>6){
        cout << "No" << endl;
        return;
    }
    vector<int> c={};rep(i,n) if(f[i]) c.push_back(i);
    for(int s:c){
        for(int t:c){
            swap(a[s],a[t]);
            bool ok=true;
            rep(i,3){
                if(s-i>=0 && s-i+2<n) {
                    int ma=max(a[s-i],max(a[s-i+1],a[s-i+2])),mi=min(a[s-i],min(a[s-i+1],a[s-i+2]));
                    if(a[s-i+1]!=ma && a[s-i+1]!=mi) ok=false;
                }
                if(t-i>=0 && t-i+2<n) {
                    int ma=max(a[t-i],max(a[t-i+1],a[t-i+2])),mi=min(a[t-i],min(a[t-i+1],a[t-i+2]));
                    if(a[t-i+1]!=ma && a[t-i+1]!=mi) ok=false;
                }
            }
            if(!ok){
                swap(a[s],a[t]);
                continue;
            }
            for(int s:ng){
                int ma=max(a[s],max(a[s+1],a[s+2])),mi=min(a[s],min(a[s+1],a[s+2]));
                if(a[s+1]!=ma && a[s+1]!=mi) ok=false;
            }
            if(ok){
                cout << "Yes" << endl;
                return;
            }
            swap(a[s],a[t]);
        }
    }
    cout << "No" << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    int t;cin >> t;
    rep(i,t) solve();
}