#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
void solve(){
    ll n;cin >> n;
    string s;cin >> s;
    bool ok=false;
    vector<ll> v(n);
    rep(i,n){
        if(s[i]=='?')v[i]=-1;
        else v[i]=s[i]-'0';
    }
    ll mask=7;
    rep(x,2){
        rep(y,2){
            if(v[n-2]==(x^1))continue;
            if(v[n-1]==(y^1))continue;
            vector<ll> nv=v;
            nv[n-2]=x,nv[x-1]=y;
            vl dp(8);
            dp[x*2+y]=1;
            rep(i,n){
                vl ndp(8);
                rep(j,8){
                    if(v[i]!=1){
                        ndp[(j<<1)&mask]|=dp[j];
                    }
                    if(v[i]!=0){
                        ndp[((j<<1)&mask)+1]|=dp[j];
                    }
                }
                ndp[7]=0;ndp[0]=0;
                swap(dp,ndp);
            }
            rep(i,8)if(dp[i])ok=true;
        }
    }
    cout << (ok? "Yes":"No") << endl;
}
int main(){
    ll t;cin >> t;
    while(t--)solve();
}