#include <bits/stdc++.h>
 
using namespace std;
 
const int MaxN = (int)2e5 + 10;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;

int n, a[MaxN], suff[MaxN], pref[MaxN];

void solve() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
	}
	pref[1] = 1;
	suff[n] = 1;
	for (int i = 2; i <= n; ++i) {
		pref[i] = pref[i - 1] & (a[i] >= a[i - 1]);
	}
	for (int i = n - 1; i >= 1; --i) {
		suff[i] = suff[i + 1] & (a[i] <= a[i + 1]);
	}
	if (pref[n]) {
		cout << "YES\n";
		return;
	}
	for (int i = 1; i + 1 <= n; ++i) {
		if (pref[i] && suff[i + 1] && a[n] <= a[1]) {
			cout << "YES\n";
			return;
		}
	}
	cout << "NO\n";
}
 
int main() {
//	freopen("input.txt", "r", stdin);
	int t;
	scanf("%d\n", &t);
	while (t --> 0) {
		solve();
	}
	return 0;
}