#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MEM(a,b) memset((a),(b),sizeof(a))
const LL INF = 1e9 + 7;
const int N = 2e5 + 10;
pair<int, int> vp[N];
pair<int, int> getsum(pair<int, int>& p1, pair<int, int>& p2)
{
	int a = p1.first * p2.second + p1.second * p2.first;
	int b = p1.second * p2.second * 2;
	int g = gcd(a, b);
	a /= g, b /= g;
	return { a,b };
}
void init()
{
	int n, o;
	while (cin >> n)
	{
		vector<pair<int, int>> vp;
		for (int i = 0; i < n; i++)
		{
			cin >> o;
			vp.emplace_back(o, 1);
		}
		queue< vector<pair<int, int>> > q;
		map< vector<pair<int, int>>, int > mc;
		q.push(vp);
		mc[vp] = 1;
		while (!q.empty())
		{
			auto v = q.front();
			q.pop();
			if (v.size() == 1)
				for (int i = 0; i < v.size(); i++)
					printf("%d/%d%c", v[i].first, v[i].second, " \n"[i + 1 == v.size()]);
			for (int i = 0; i + 1 < v.size(); i++)
			{
				vector<pair<int, int>> v0;
				for (int j = 0; j < v.size(); j++)
				{
					if (j != i) v0.push_back(v[j]);
					else v0.push_back(getsum(v[j], v[j + 1])), j++;
				}
				if (mc.count(v0)) continue;
				mc[v0] = 1;
				q.push(v0);
			}
		}
	}
}
bool check(vector<int> v)
{
	while (v.front() == v.back())
	{
		int x = v.back();
		while (!v.empty() && v.back() == x)
			v.pop_back();
		if (v.empty()) return false;
		v.pop_back();
		if (v.empty()) return true;
	}
	return true;
}
int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	//init();
	int ncase;
	scanf("%d", &ncase);
	while (ncase--)
	{
		int n;
		scanf("%d", &n);
		vector<int> v(n);
		for (auto& x : v)
			scanf("%d", &x);
		if (check(v))
		{
			puts("Yes");
			continue;
		}
		//while (v.size() >= 2 && v[v.size() - 1] == v[v.size() - 2])
		//	v.pop_back();
		//reverse(v.begin(), v.end());
		//while (v.size() >= 2 && v[v.size() - 1] == v[v.size() - 2])
		//	v.pop_back();
		int cnt = 1;
		for (int i = 1; i < v.size(); i++)
		{
			if (v[i] != v[i - 1])
				cnt++;
		}
		if (cnt >= 9)
		{
			puts("Yes");
		}
		else puts("No");

	}
	return 0;
}