#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

bool solve(lint N, string S) {
	lint a=0, b=0, c=0, x, y, z;
	vvi dp0(N+2, vi(3)), dp1(N+2, vi(3));
	if (S[0] == '?') {
		S[0] = '0';
		x = solve(N, S);
		S[0] = '1';
		y = solve(N, S);
		return x || y;
	}
	if (S[1] == '?') {
		S[1] = '0';
		x = solve(N, S);
		S[1] = '1';
		y = solve(N, S);
		return x || y;
	}
	rep(i, N+2) {
		if (S[i%N] == '0' || S[i%N] == '?') {
			if (i == 0 || dp1[i-1][0] || dp1[i-1][1]) {
				dp0[i][0] = 1;
			} else if (i && dp0[i-1][0]) {
				dp0[i][1] = 1;
			} else if (i && dp0[i-1][1]) {
				dp0[i][2] = 1;
			}
		}
		if (S[i%N] == '1' || S[i%N] == '?') {
			if (i == 0 || dp0[i-1][0] || dp0[i-1][1]) {
				dp1[i][0] = 1;
			} else if (i && dp1[i-1][0]) {
				dp1[i][1] = 1;
			} else if (i && dp1[i-1][1]) {
				dp1[i][2] = 1;
			}
		}
	}
	if (dp0[N+1][0] || dp0[N+1][1] || dp1[N+1][0] || dp1[N+1][1]) return true;
	else return false;
}

int main() {
	lint T;
	cin >> T;

	rep(_, T) {
		lint N;
		string S;
		cin >> N >> S;
		if (solve(N, S)) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
}