#include <bits/stdc++.h>
#include <atcoder/all>

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using namespace std;
using namespace atcoder;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, n, m) for (int i = n; i < (int)(m); i++)
#define repll2(i, n, m) for (long long i = n; i < (long long)(m); i++)
#define all(v) v.begin(),v.end()
using ll=long long;
using ld=long double;
using vi=vector<int>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vvvl=vector<vvl>;
using vld=vector<ld>;
using vvld=vector<vld>;

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,1,-1};

const double PI = acos(-1);
//const ll MOD=1e9+7;
//const ll MOD=998244353;
const ll INF=(1LL<<60);
const int INF2=(1<<30);
//using mint=modint1000000007;
//using mint=modint998244353;

int n;
string s;

vvvi memo;

int dp(int i,int j,int k){
    if(memo[i][j][k]!=-1)return memo[i][j][k];
    if(s[i]=='0'&&j==0)return 0;
    if(s[i]=='1'&&j==3)return 0;
    //cout<<i<<" "<<j<<" "<<k<<endl;
    if(i==n-1){
        if(s[i]=='0'){
            if(k==0)return 0;
            if(j==2||k==1)return 0;
            return 1;
        }
        else if(s[i]=='1'){
            if(k==3)return 0;
            if(j==1&&k==2)return 0;
            return 1;
        }
        if(j==3&&k==0)return 0;
        if(j==0&&k==3)return 0;
        return 1;
    }
    int res=0;
    int r=j%2;
    if(s[i]=='0'){
        res=max(res,dp(i+1,r*2,k));
    }
    else if(s[i]=='1'){
        res=max(res,dp(i+1,r*2+1,k));
    }
    else{
        res=max(res,dp(i+1,r*2,k));
        res=max(res,dp(i+1,r*2+1,k));
    }
    memo[i][j][k]=res;
    return res;
}



void solve(){
    cin>>n>>s;
    int res=0;
    //memset(memo,-1,sizeof(memo));
    vvvi arr(n+1,vvi(4,vi(4,-1)));
    memo=arr;
    if(s[0]!='?'){
        int r1=s[0]-'0';
        if(s[1]!='?'){
            int r2=s[1]-'0';
            res=max(res,dp(2,2*r1+r2,2*r1+r2));
        }
        else{
            s[1]=1;
            res=max(res,dp(2,2*r1+1,2*r1+1));
            s[1]=0;
            res=max(res,dp(2,2*r1,2*r1));
            s[1]='?';
        }
    }
    else{
        rep(i,2){
            s[0]=i;
            if(s[1]=='?'){
                rep(j,2){
                    s[1]=j;
                    res=max(res,dp(2,2*i+j,2*i+j));
                }
            }
            else{
                int r1=s[0]-'0';
                int r2=s[1]-'0';
                res=max(res,dp(2,2*r1+r2,2*r1+r2));
            }
        }
    }
    if(res)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int t;cin>>t;
    while(t--)solve();
    return 0;
}