#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
int T,N,a[50001];
void solve1(){
  for(int i=0;i<N;++i){
    for(int j=i+1;j<N;++j){
      swap(a[i],a[j]);
      bool f=true;
      for(int k=1;k<N-1;++k){
        if(a[k-1]==a[k]||a[k]==a[k+1]||a[k-1]==a[k+1]||(a[k-1]<a[k]&&a[k]<a[k+1])||(a[k-1]>a[k]&&a[k]>a[k+1])){
          f=false;
          break;
        }
      }
      if(f){
        puts("Yes");
        return;
      }
      swap(a[i],a[j]);
    }
  }
  puts("No");
  return;
}
void solve2(){
  vector<int> lis;
  for(int k=1;k<N-1;++k){
    if(a[k-1]==a[k]||a[k]==a[k+1]||a[k-1]==a[k+1]||(a[k-1]<a[k]&&a[k]<a[k+1])||(a[k-1]>a[k]&&a[k]>a[k+1])){
      lis.emplace_back(k-1);
      lis.emplace_back(k);
      lis.emplace_back(k+1);
    }
  }
  sort(lis.begin(),lis.end());
  lis.erase(unique(lis.begin(),lis.end()),lis.end());
  if(lis.size()>10){
    puts("No");
    return;
  }
  for(auto x:lis)for(auto y:lis){
    if(x>=y)continue;
    swap(a[x],a[y]);
    bool f=true;
    for(int k=1;k<N-1;++k){
      if(a[k-1]==a[k]||a[k]==a[k+1]||a[k-1]==a[k+1]||(a[k-1]<a[k]&&a[k]<a[k+1])||(a[k-1]>a[k]&&a[k]>a[k+1])){
        f=false;
        break;
      }
    }
    if(f){
      puts("Yes");
      return;
    }
    swap(a[x],a[y]);
  }
  puts("No");
}
int main(){
  scanf("%d",&T);
  for(int z=0;z<T;z++){
    scanf("%d",&N);
    for(int i=0;i<N;++i)scanf("%d",&a[i]);
    solve2();
  }
}