#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int t;
  cin>>t;
  while(t--){
    int n;
    string s;
    cin>>n>>s;
    
    if(s[0]!='1' && s[1]!='1'){
      vector<vector<int>> dp(n,vector<int> (4));
      dp[1][0]=1;
      if(s[1]=='?') dp[1][1]=1;
      if(s[0]=='?') dp[1][2]=1;
      if(s[0]=='?' && s[1]=='?') dp[1][3]=1;
      
      for(int i=1;i<n-1;i++){
        for(int j=0;j<4;j++){
          if(s[i+1]=='0'){
            if(j!=0) dp[i+1][(j%2)*2]|=dp[i][j];
          }
          else if(s[i+1]=='1'){
            if(j!=3) dp[i+1][(j%2)*2+1]|=dp[i][j];
          }
          else if(s[i+1]=='?'){
            if(j!=0) dp[i+1][(j%2)*2]|=dp[i][j];
            if(j!=3) dp[i+1][(j%2)*2+1]|=dp[i][j];
          }
        }
      }
      if(dp[n-1][1] || dp[n-1][3]){
        cout<<"Yes\n";
        continue;
      }
    }
    
    if(s[0]!='1' && s[1]!='0'){
      vector<vector<int>> dp(n,vector<int> (4));
      dp[1][1]=1;
      if(s[1]=='?') dp[1][0]=1;
      if(s[0]=='?') dp[1][3]=1;
      if(s[0]=='?' && s[1]=='?') dp[1][2]=1;
      
      for(int i=1;i<n-1;i++){
        for(int j=0;j<4;j++){
          if(s[i+1]=='0'){
            if(j!=0) dp[i+1][(j%2)*2]|=dp[i][j];
          }
          else if(s[i+1]=='1'){
            if(j!=3) dp[i+1][(j%2)*2+1]|=dp[i][j];
          }
          else if(s[i+1]=='?'){
            if(j!=0) dp[i+1][(j%2)*2]|=dp[i][j];
            if(j!=3) dp[i+1][(j%2)*2+1]|=dp[i][j];
          }
        }
      }
      if(dp[n-1][1] || dp[n-1][2]|| dp[n-1][3]){
        cout<<"Yes\n";
        continue;
      }
    }
    
    if(s[0]!='0' && s[1]!='1'){
      vector<vector<int>> dp(n,vector<int> (4));
      dp[1][2]=1;
      if(s[1]=='?') dp[1][3]=1;
      if(s[0]=='?') dp[1][0]=1;
      if(s[0]=='?' && s[1]=='?') dp[1][1]=1;
      
      for(int i=1;i<n-1;i++){
        for(int j=0;j<4;j++){
          if(s[i+1]=='0'){
            if(j!=0) dp[i+1][(j%2)*2]|=dp[i][j];
          }
          else if(s[i+1]=='1'){
            if(j!=3) dp[i+1][(j%2)*2+1]|=dp[i][j];
          }
          else if(s[i+1]=='?'){
            if(j!=0) dp[i+1][(j%2)*2]|=dp[i][j];
            if(j!=3) dp[i+1][(j%2)*2+1]|=dp[i][j];
          }
        }
      }
      if(dp[n-1][0] || dp[n-1][1] || dp[n-1][2]){
        cout<<"Yes\n";
        continue;
      }
    }
    
    if(s[0]!='0' && s[1]!='0'){
      vector<vector<int>> dp(n,vector<int> (4));
      dp[1][3]=1;
      if(s[1]=='?') dp[1][2]=1;
      if(s[0]=='?') dp[1][1]=1;
      if(s[0]=='?' && s[1]=='?') dp[1][0]=1;
      
      for(int i=1;i<n-1;i++){
        for(int j=0;j<4;j++){
          if(s[i+1]=='0'){
            if(j!=0) dp[i+1][(j%2)*2]|=dp[i][j];
          }
          else if(s[i+1]=='1'){
            if(j!=3) dp[i+1][(j%2)*2+1]|=dp[i][j];
          }
          else if(s[i+1]=='?'){
            if(j!=0) dp[i+1][(j%2)*2]|=dp[i][j];
            if(j!=3) dp[i+1][(j%2)*2+1]|=dp[i][j];
          }
        }
      }
      if(dp[n-1][0] || dp[n-1][2]){
        cout<<"Yes\n";
        continue;
      }
    }
    cout<<"No\n";
  }
  
  return 0;
}