bool f(int a,int b,int c){return a!=c&&((a<b&&c<b)||(a>b&&c>b));}

int N,A[5d4],a,ok;

void L(){
 rd(N,A(N));
 int p=-1;
 VI W;
 rep(i,N-2)if(!f(A[i],A[i+1],A[i+2]))W.push_back(i);
 p=W[0];
 a=0;
 rep(l,p,p+3){
  rep(r,N){
   ok=1;
   swap(A[l],A[r]);
   if(ok)for(int w:W)if(!f(A[w],A[w+1],A[w+2]))ok=0,break;
   if(ok)rep(i,max(0,l-2),min(N-2,l+2)) if(!f(A[i],A[i+1],A[i+2]))ok=0,break;
   if(ok)rep(i,max(0,r-2),min(N-2,r+2)) if(!f(A[i],A[i+1],A[i+2]))ok=0,break;
   swap(A[l],A[r]);
   if(ok)a=1;
  }
  if(a)break;
 }
 wt(a?"Yes":"No");
}
{int @T;while(T--)L();}