/* 
 * Author: $%U%$
 * Time: $%Y%$-$%M%$-$%D%$ $%h%$:$%m%$:$%s%$
 */
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=200003,M=3003,K=503,MOD=998244353,INF=9000000000000000007ll;
#define rep(i,a,b) for(ll i=(a);i<=(b);i++)
#define per(i,a,b) for(ll i=(a);i>=(b);i--)
#define re(i,a,b) for(ll i=(a);i<(b);i++)
#define pe(i,a,b) for(ll i=(a);i>(b);i--)
ll gcd(ll A,ll B){return B?gcd(B,A%B):A;}
ll pw(ll A,ll B){
	ll res=1;
	while(B){
		if(B&1)res=res*A%MOD;
		A=A*A%MOD;
		B>>=1;
	}
	return res;
}
#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
template <typename T>
inline void read(T& r) {
	r=0;bool w=0; char ch=getchar();
	while(ch<'0'||ch>'9') w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9') r=r*10+(ch^48), ch=getchar();
	r=w?-r:r;
}
template <typename T>
inline void readupp(T& r){
	r=0;
	char ch=getchar();
	while(ch>'Z'||ch<'A')ch=getchar();
	r=ch;
}
template <typename T>
inline void readlow(T& r){
	r=0;
	char ch=getchar();
	while(ch>'z'||ch<'a')ch=getchar();
	r=ch;
}
template <typename T>
inline void readdig(T& r){
	r=0;
	char ch=getchar();
	while(ch>'9'||ch<'0')ch=getchar();
	r=ch-'0';
}
template <typename T>
inline void readvisi(T& r){
	r=0;
	char ch=getchar();
	while(ch>126||ch<33)ch=getchar();
	r=ch;
}
template <typename T>
inline ll readlowstr(T& r){
	ll n=0;
	char ch=getchar();
	while(ch>'z'||ch<'a')ch=getchar();
	while(ch<='z'&&ch>='a')r[++n]=ch,ch=getchar();
	return n;
}
template <typename T>
inline ll readuppstr(T& r){
	ll n=0;
	char ch=getchar();
	while(ch>'Z'||ch<'A')ch=getchar();
	while(ch<='Z'&&ch>='A')r[++n]=ch,ch=getchar();
	return n;
}
template <typename T>
inline ll readdigstr(T& r){
	ll n=0;
	char ch=getchar();
	while(ch>'9'||ch<'0')ch=getchar();
	while(ch<='9'&&ch>='0')r[++n]=ch,ch=getchar();
	return n;
}
template <typename T>
inline ll readvisistr(T& r){
	ll n=0;
	char ch=getchar();
	while(ch>126||ch<33)ch=getchar();
	while(ch<=126&&ch>=33)r[++n]=ch,ch=getchar();
	return n;
}
void _FILE(string s){
	freopen((s+".in").c_str(),"r",stdin);
	freopen((s+".out").c_str(),"w",stdout);
}
ll T,n;
char a[N];
set<pair<ll,ll> > s;
bool flag;
bool vst[N];
void upd(pair<ll,ll> t){
	ll o1=t.first,o2=t.second;
	vst[o1]=1;
	ll o3=(o1+n-1)%n,o4=(o2+1)%n;
	if(a[o3]==a[o1]||a[o4]==a[o2]){
		flag=0;
		return;
	}
	a[o3]=a[o1]^1,a[o4]=a[o2]^1;
	ll o5=(o3+n-1)%n,o6=(o4+1)%n;
	if(a[o3]==a[o5]&&!vst[o5])s.insert(make_pair(o5,o3));
	if(a[o4]==a[o6]&&!vst[o4])s.insert(make_pair(o4,o6));
}
int main(){
	read(T);
	while(T--){
		read(n);
		re(i,0,n)readvisi(a[i]);
		fill(vst,vst+n,0);
		s.clear();
		flag=1;
		re(i,0,n){
			if(a[i]==a[(i+1)%n]&&a[i]!='?')s.insert(make_pair(i,(i+1)%n));
		}
		while(!s.empty()){
			pair<ll,ll> tmp=*s.begin();
			s.erase(s.begin());
			upd(tmp);
			if(!flag)break;
		}
		re(i,0,n){
			if(a[i]==a[(i+1)%n]&&a[(i+1)%n]==a[(i+2)%n]&&a[i]!='?')flag=0;
		}
		if(flag)puts("Yes");
		else puts("No");
	}
	return 0;
}