#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

bool is_kadomatsu(long long a,long long b,long long c){
	if(a==b||b==c||c==a)return false;
	if(b>a&&b>c)return true;
	if(b<a&&b<c)return true;
	return false;
}

int main(){
	
	int T;
	cin>>T;
	
	rep(_,T){
		int N;
		scanf("%d",&N);
		
		vector<long long> A(N);
		rep(i,N){
			scanf("%lld",&A[i]);
		}
		vector<int> ind;
		int cnt = 0;
		rep(i,N-2){
			if(is_kadomatsu(A[i],A[i+1],A[i+2]))continue;
			rep(j,3){
				ind.push_back(i+j);
			}
			cnt ++;
		}
		sort(ind.begin(),ind.end());
		ind.erase(unique(ind.begin(),ind.end()),ind.end());
	//	cout<<ind.size()<<endl;
		if(ind.size()>10){
			printf("No\n");
			continue;
		}
		bool f = false;
		rep(i,ind.size()){
			int x = ind[i];
			rep(j,N){
				int y = j;
				if(x==y)continue;
				int X = 0;
				vector<int> t;
				for(int k=x-2;k<=x;k++)t.push_back(k);
				for(int k=y-2;k<=y;k++)t.push_back(k);
				sort(t.begin(),t.end());
				t.erase(unique(t.begin(),t.end()),t.end());
				rep(l,t.size()){
					int k = t[l];
					if(k<0)continue;
					if(k+2>=N)break;
					if(!is_kadomatsu(A[k],A[k+1],A[k+2]))X++;
				}
				
				swap(A[x],A[y]);
				rep(l,t.size()){
					int k = t[l];
					if(k<0)continue;
					if(k+2>=N)break;
					if(!is_kadomatsu(A[k],A[k+1],A[k+2]))X--;
				}
				swap(A[x],A[y]);
				/*
				if(x==1&&y==2){
					cout<<X<<endl;
					cout<<cnt<<endl;
				}
				*/
				if(X==cnt){
					f=true;
					break;
				}
				
			}
			if(f)break;
		}
		
		if(f)cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
		
	
    return 0;
}