#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]--;

  auto check = [](int a,int b,int c){
    if(a==b||b==c||c==a) return false;
    if(a<b&&b>c) return true;
    if(a>b&&b<c) return true;
    return false;
  };

  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);
        }
      }
    }
    sort(all(idxs));
    idxs.erase(unique(all(idxs)),idxs.end());
    int V=idxs.size();
    if(V>=7){
      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;
        }
      }

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

    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;
}