void main()
{
	const TE = readInt;
	foreach (_; 0 .. TE) {
		const N = readInt;
		auto A = new int[N];
		foreach (i; 0 .. N) {
			A[i] = readInt;
		}
		bool ans = true;
		foreach (i; 0 .. N) {
			ans = ans && !(A[i] == 2 && A[(i + 1) % N] == 2);
			ans = ans && !(A[i] == 0 && A[(i + 1) % N] == 0);
			ans = ans && !(A[(i - 1 + N) % N] == 0 && A[i] == 1 && A[(i + 1) % N] == 0);
			ans = ans && !(A[(i - 1 + N) % N] == 2 && A[i] == 1 && A[(i + 1) % N] == 2);
		}
		ans = ans && cast(int)(A.count(1)) < N;
		ans = ans && A.sum == N;
		writeln(ans ? "Yes" : "No");
	}
}

import std,core.bitop;
string[]_R;
string readString(){while(_R.empty){_R=readln.chomp.split;}auto ret=_R.front;_R.popFront;return ret;}
int readInt(){return readString.to!int;}
long readLong(){return readString.to!long;}
ulong readULong(){return readString.to!ulong;}
real readReal(){return readString.to!real;}
bool chmin(T)(ref T A,T B){if(A>B){A=B;return true;}else{return false;}}
bool chmax(T)(ref T A,T B){if(A<B){A=B;return true;}else{return false;}}
int lowerBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<x?L:R)=mid;}return R;}
int upperBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<=x?L:R)=mid;}return R;}