/* -*- coding: utf-8 -*-
 *
 * 2518.cc:  No.2518 Adjacent Larger - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

/* global variables */

int as[MAX_N], bs[MAX_N];

/* subroutines */

/* main */

int main() {
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) scanf("%d", as + i);

    int m = 0;
    for (int i = 0; i < n; i++)
      if (as[i] != 1) bs[m++] = as[i];

    bool ok = false;
    if (m > 1) {
      ok = (bs[0] != bs[m - 1]);
      for (int i = 0; ok && i + 1 < m; i++)
	ok = (bs[i] != bs[i + 1]);
    }

    if (ok) puts("Yes");
    else puts("No");
  }
  return 0;
}