#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <complex>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
template<typename T>
istream &operator>>(istream &is,vector<T> &a){
  for(auto &i:a)is>>i;
  return is;
}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
int main(){
  int t;
  cin>>t;
  while(t--){
    int n;
    string s;
    cin>>n>>s;
    s+=s.substr(0,3);
    n=s.size();
    vector<vector<vector<bool>>>dp(n+1,vector<vector<bool>>(2,vector<bool>(2,false)));
    rep(i,2)rep(j,2)dp[0][i][j]=true;
    rep(i,n){
      rep(j,2)rep(k,2){
        if(!dp[i][j][k])continue;
        if(j!=k){
          if(s[i]=='0')dp[i+1][0][j]=true;
          else if(s[i]=='1')dp[i+1][1][j]=true;
          else{
            dp[i+1][0][j]=true;
            dp[i+1][1][j]=true;
          }
        }
        else if(j==0){
          if(s[i]=='1')dp[i+1][1][0]=true;
          else if(s[i]=='?')dp[i+1][1][0]=true;
        }
        else{
          if(s[i]=='0')dp[i+1][0][1]=true;
          else if(s[i]=='?')dp[i+1][0][1]=true;
        }
      }
    }
    bool ans=false;
    rep(i,2)rep(j,2)ans|=dp[n][i][j];
    cout<<(ans?"Yes":"No")<<endl;
  }
}