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

using namespace std;
using ll = long long;

void solve(){
    ll N, a, b;
    string S;
    cin >> N >> S;
    for (int i=0; i<N; i++){
        if (S[i] != '?') continue;
        a = (i-2+N) % N;
        b = (i-1+N) % N;
        if (S[a] == S[b] && S[a] != '?'){
            S[i] = (S[a] == '1' ? '0' : '1');
        }
    }
    for (int i=N-1; i>=0; i--){
        if (S[i] != '?') continue;
        a = (i+1) % N;
        b = (i+2) % N;
        if (S[a] == S[b] && S[a] != '?'){
            S[i] = (S[a] == '1' ? '0' : '1');
        }
    }

    for (int i=0; i<N; i++){
        if (S[i] != '?' && S[i] == S[(i+1)%N] && S[(i+1)%N] == S[(i+2)%N]){
            cout << "No" << endl;
            return;
        }
    }
    cout << "Yes" << endl;
}

int main(){

    int T;
    cin >> T;
    while(T){
        T--;
        solve();
    }

    return 0;
}