#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(),(x).end()
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;

ll T;
ll n;
ll a[50005];
vector<ll> vec;

bool check(ll a, ll b, ll 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;
}

bool calc(ll x)
{
	if(x <= 1 || x >= n) return true;
	return check(a[x-1], a[x], a[x+1]);
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> T;
	while(T--){
		cin >> n;
		rep(i, 1, n) cin >> a[i];
		
		vec.clear();
		rep(i, 2, n-1) if(!check(a[i-1], a[i], a[i+1])) vec.push_back(i);
		if(vec.size() >= 7){
			cout << "No" << endl;
			continue;
		}
		set<ll> S;
		for(auto x : vec) S.insert(x-1), S.insert(x), S.insert(x+1);
		
		vec.clear();
		for(auto x : S) vec.push_back(x);
		
		ll m = vec.size();
		rep(i, 0, m-1) rep(j, 0, m-1){
			if(i >= j) continue;
			swap(a[vec[i]], a[vec[j]]);
			
			//rep(k, 1, n) cout << a[k] << " "; cout << endl;
			
			bool flag = true;
			rep(k, 0, m-1) flag &= calc(vec[k]);
			rep(k, -1, 1) flag &= calc(vec[i]+k) && calc(vec[j]+k);
			if(flag){
				cout << "Yes" << endl;
				goto end;
			}
			swap(a[vec[i]], a[vec[j]]);
		}
		cout << "No" << endl;
		end:;
	}
	
	return 0;
}