#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}

map<V<double>,bool> memo;
bool can(V<double> a){
	if(memo.count(a)) return memo[a];
	int N = si(a);
	if(N == 1) return a[0] == 0.5;
	rep(i,N-1){
		V<double> b;
		rep(j,N){
			if(j == i){
				b.pb((a[j]+a[j+1])/2);
				j++;
			}else{
				b.pb(a[j]);
			}
		}
		if(can(b)) return memo[a] = true;
	}
	return memo[a] = false;
}

bool brute(V<int> a_){
	V<double> a;
	for(int v: a_) a.pb(v);
	return can(a);
}

bool solve(V<int> a){
	int N = si(a);
	if(a[0] != a[N-1]) return true;
	if(a[0] == 1){
		rep(i,N) a[i] = 1-a[i];
	}
	int one = 0;
	rep(i,N) if(a[i]) one++;
	if(one == 0) return false;
	rep(i,N-1) if(a[i]&&a[i+1]) return true;
	return one >= 4;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int T; cin >> T;
	while(T--){
		int N; cin >> N;
		V<int> a(N); rep(i,N) cin >> a[i];
		cout << (solve(a) ? "Yes" : "No") << endl;
	}
	return 0;

	// int N; cin >> N;
	// rep1(n,N){
	// 	rep(s,1<<n){
	// 		V<int> a(n);
	// 		rep(i,n) a[i] = (s>>i)&1;
	// 		bool god = brute(a);
	// 		bool res = solve(a);
	// 		if(god != res){
	// 			show(a);show(god);show(res);assert(0);
	// 		}
	// 	}
	// }

}