#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

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; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

bool dp[100000][2][2][2][2];

void solve(){
    int n; cin >> n;
    string ss; cin >> ss;
    vector<int> s(n);
    for(int i = 0; i <= n; i++){
        for(int j = 0; j < 2; j++){
            for(int k = 0; k < 2; k++){
                for(int l = 0; l < 2; l++){
                    for(int p = 0; p < 2; p++){
                        dp[i][j][k][l][p] = false;
                    }
                }
            }
        }
    }
    for(int i = 0; i < n; i++){
        if(ss[i] == '?') s[i] = -1;
        else s[i] = ss[i]-'0';
    }
    for(int i = 0; i < 2; i++){
        if(s[0] != -1 && s[0] != i) continue;
        for(int j = 0; j < 2; j++){
            if(s[1] != -1 && s[1] != j) continue;
            dp[1][i][j][i][j] = true;
        }
    }
    for(int i = 2; i < n; i++){
        for(int j = 0; j < 2; j++){
            for(int k = 0; k < 2; k++){
                for(int l = 0; l < 2; l++){
                    for(int p = 0; p < 2; p++){
                        if(!dp[i-1][j][k][l][p]) continue;
                        for(int q = 0; q < 2; q++){
                            if(s[i] != -1 && s[i] != q) continue;
                            if(l == p && p == q) continue;
                            dp[i][j][k][p][q] = true;
                        }
                    }
                }
            }
        }
    }
    for(int j = 0; j < 2; j++){
        for(int k = 0; k < 2; k++){
            for(int l = 0; l < 2; l++){
                for(int p = 0; p < 2; p++){
                    if(l == p && p == j) continue;
                    if(p == j && j == k) continue;
                    if(dp[n-1][j][k][l][p]){
                        cout << "Yes" << endl;
                        return;
                    }
                }
            }
        }
    }
    cout << "No" << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) solve();
}