import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
import random
def solve():
    n = ii()
    a = [-1 if v == '?' else int(v) for v in input()]
    dp = [[[0] * 2 for _ in range(2)] for _ in range(n + 1)]

    if a[0] == a[1] == -1:
        dp[2][0][0] = 1
        dp[2][0][1] = 1
        dp[2][1][0] = 1
        dp[2][1][1] = 1
    elif a[0] == -1:
        dp[2][0][a[1]] = 1
        dp[2][1][a[1]] = 1
    elif a[1] == -1:
        dp[2][a[0]][0] = 1
        dp[2][a[0]][1] = 1
    else:
        dp[2][a[0]][a[1]] = 1

    for i in range(2, n):
        for j in range(2):
            for k in range(2):
                if a[i] == -1:
                    if j == k:
                        dp[i + 1][k][1 - k] |= dp[i][j][k]
                    else:
                        dp[i + 1][k][0] |= dp[i][j][k]
                        dp[i + 1][k][1] |= dp[i][j][k]
                else:
                    if j == k == a[i]:
                        pass
                    else:
                        dp[i + 1][k][a[i]] |= dp[i][j][k]
    
    for a1 in range(2):
        for a2 in range(2):
            for b1 in range(2):
                for b2 in range(2):
                    if not((a1 == a2 == b2) or (a1 == b1 == b2)) and dp[2][a1][a2] and dp[n][b1][b2]:
                        print('Yes')
                        return
    print('No')


for _ in range(ii()):
    solve()