#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

void solve(){
  int N;
  cin>>N;
  vector<int> A(N);
  rep(i,N) cin>>A[i];

  rep(i,N) A[i]--;

  for(int t=0;t<2;t++){
    vector<int> idxs;
    for(int i=0;i+1<N;i++){
      if(i%2==0){
        if(A[i]<=A[i+1]){
          idxs.push_back(i);
          idxs.push_back(i+1);
        }
      }else{
        if(A[i]>=A[i+1]){
          idxs.push_back(i);
          idxs.push_back(i+1);
        }
      }
    }
    for(int i=0;i+2<N;i++) if(A[i]==A[i+2]){
        idxs.push_back(i);
        idxs.push_back(i+2);
    }
    sort(all(idxs));
    idxs.erase(unique(all(idxs)),idxs.end());
    int V=idxs.size();
    if(V>=11){
      rep(i,N) A[i]=-A[i];
      continue;
    }

    for(int j=0;j<V;j++) for(int k=j+1;k<V;k++){
      swap(A[idxs[j]],A[idxs[k]]);
      bool ok=true;
      for(int i=0;i+1<N;i++){
        if(i%2==0){
          if(A[i]<=A[i+1]) ok=false;
        }else{
          if(A[i]>=A[i+1]) ok=false;
        }
      }
      for(int i=0;i+2<N;i++) if(A[i]==A[i+2]) ok=false;

      if(ok){
        cout<<"Yes"<<"\n";
        return;
      }
      swap(A[idxs[j]],A[idxs[k]]);
    }

    set<int> se;
    rep(i,V) se.insert(idxs[i]);

    auto check = [&](int now)->bool{
        for(int i=now-2;i<=now+2;i++){
            if(i>=0&&i+2<N) if(A[i]==A[i+2]) return false;
        }
        for(int i=now-2;i<=now+2;i++){
            if(i>=0&&i+1<N){
                if(i%2==0){
                    if(A[i]<=A[i+1]) return false;
                }else{
                    if(A[i]>=A[i+1]) return false;
                }
            }
        }
        return true;
    };
    
    for(auto id:idxs){
        for(int d=id-2;d<=id+2;d++){
            if(se.count(d)) se.erase(d);
        }

        for(int i=0;i<N;i++){
            if(i==id) continue;
            map<int,int> mp;
            for(int d=i-2;d<=i+2;d++){
                if(se.count(d)){
                    se.erase(d);
                    mp[d]=1;
                }
            }
            swap(A[i],A[id]);
            if(se.empty()&&check(i)&&check(id)){
                cout<<"Yes"<<"\n";
                return;
            }
            swap(A[i],A[id]);
            for(auto m:mp) se.insert(m.first);
        }
        rep(i,V) if(se.count(idxs[i])==false) se.insert(idxs[i]);
    }

    rep(i,N) A[i]=-A[i];
  }

  cout<<"No"<<"\n";
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int T;
  cin>>T;
  rep(i,T) solve();

  return 0;
}