#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define ll long long
#define rep(i,n) for (int i = 0; i < (n); i++)
#define coutf(f) cout << fixed << setprecision(f)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

void solve() {
	int n;
	string s;
	cin >> n >> s;
	rep(c, 2) {
		rep(i, n * 2) {
			if (s[i % n] != '?' && s[i % n] == s[(i + 1) % n] && s[(i + 2) % n] == '?') {
				s[(i + 2) % n] = (s[i % n] == '0' ? '1' : '0');
			}
		}
		reverse(all(s));
	}
	rep(i, n) {
		if (s[i] != '?' && s[i] == s[(i + 1) % n] && s[i] == s[(i + 2) % n]) {
			cout << "No" << endl;
			return;
		}
	}
	cout << "Yes" << endl;
}

int main() {
	int t;
	cin >> t;
	while (t--) solve();
	return 0;
}