#include <bits/stdc++.h>
using namespace std;
#define rep(i, d, u) for(int i = d; i <= u; ++i)
#define dep(i, u, d) for(int i = u; i >= d; --i)
#define cep(n) while(n--)
#define gep(i, a) for(int i = firs[a]; i; i = neig[i])
int ured() {
	int re = 0;
	char ch;
	do {
		ch = getchar();
	} while('9' < ch || ch < '0');
	do {
		re = re * 10 + (ch ^ '0');
	} while('0' <= (ch = getchar()) && ch <= '9');
	return re;
}
void uwit(int da) {
	int ch[21], cn = 0;
	do {
		ch[++cn] = da - da / 10 * 10;
	} while(da /= 10);
	do {
		putchar('0' ^ ch[cn]);
	} while(--cn);
}
const int _maxn = 400011;
int t, n, p[_maxn], cnts;
int main() {
	t = ured();
	cep(t) {
		n = ured();
		rep(i, 1, n) {
			p[i] = ured();
		}
		cnts = p[1] - p[n] == 1;
		rep(i, 1, n) {
			cnts += p[i + 1] - p[i] == 1;
		}
		if(cnts == n - 1) {
			puts("Yes");
		} else {
			puts("No");
		}
	}
	return 0;
}