#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		string s; cin >> s;
		vector dp(n, vector(4, vector<bool>(4)));
		if (('1' != s[0]) && ('1' != s[1]))dp[1][0][0] = true;
		if (('1' != s[0]) && ('0' != s[1]))dp[1][1][1] = true;
		if (('0' != s[0]) && ('1' != s[1]))dp[1][2][2] = true;
		if (('0' != s[0]) && ('0' != s[1]))dp[1][3][3] = true;

		rep2(i, 2, n) {
			rep(j, 4)rep(k, 4) {
				if (!dp[i - 1][j][k])continue;
				int ni = i;
				int nj = j;
				int nk = (k * 2) % 4;
				if ('1' != s[i]) {
					if (0 != k)dp[ni][nj][nk] = true;
				}
				if ('0' != s[i]) {
					nk += 1;
					if (3 != k)dp[ni][nj][nk] = true;
				}
			}
		}
		bool chk = false;
		rep(i, 4)rep(j, 4) {
			if (!dp[n - 1][i][j])continue;
			if ((0 == i) && (0 == j % 2))continue;
			if ((3 == i) && (1 == j % 2))continue;
			if (((0 == i) || (1 == i)) && (0 == j))continue;
			if (((2 == i) || (3 == i)) && (3 == j))continue;
			chk = true;
		}
		if (chk)cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}