import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


bool solve(const(int[]) A) {
  const N = cast(int)(A.length);
  if (A[0] != A[N - 1]) {
    return true;
  }
  int cnt;
  for (int i = 0, j = 0; i < N; i = j) {
    for (; j < N && A[i] == A[j]; ++j) {}
    if (A[0] != A[i]) {
      ++cnt;
      if (j - i >= 2) {
        return true;
      }
    }
  }
  return (cnt >= 4);
}

void main() {
  //*
  debug {{
    foreach (n; 1 .. 10 + 1) {
      int cnt;
      foreach (p; 0 .. 1 << n) {
        bool check(const(int[]) bs) {
          const bsLen = cast(int)(bs.length);
          if (bsLen <= 1) {
            return (bs == [1 << (n-1)]);
          } else {
            foreach (i; 0 .. bsLen - 1) {
              assert((bs[i]+bs[i+1]) % 2 == 0);
              if (check(bs[0 .. i] ~ ((bs[i]+bs[i+1])/2) ~ bs[i+2 .. $])) {
                return true;
              }
            }
            return false;
          }
        }
        const as = iota(n).map!(i => (p >> (n-1-i) & 1) ? 1 : 0).array;
        const bs = iota(n).map!(i => (p >> (n-1-i) & 1) ? (1 << n) : 0).array;
        const brt = check(bs);
        const slv = solve(as);
        assert(brt == slv, format("%s: %s %s", as, brt, slv));
        if (!brt) {
          ++cnt;
          // foreach (i; 0 .. n) write(as[i] ? 1 : 0);
          // writeln;
        }
      }
      stderr.writeln(n, ": ", cnt);
      stderr.flush;
    }
  }}
  //*/
  
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readInt;
        auto A = new int[N];
        foreach (i; 0 .. N) {
          A[i] = readInt;
        }
        
        const ans = solve(A);
        writeln(ans ? "Yes" : "No");
      }
    }
  } catch (EOFException e) {
  }
}