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

def solve():
    n = ii()
    s = [-1 if v == '?' else int(v) for v in input()]
    p = []
    for i in range(n):
        if s[i] == -1:
            p.append(i)
    p = list(set(p[:2] + p[-2:]))

    m = len(p)

    for bit in range(1 << m):
        a = s[::]
        for i in range(m):
            if 1 & (bit >> i):
                a[p[i]] = 1
            else:
                a[p[i]] = 0
        dp = [[[0] * (n + 1) for _ in range(2)] for _ in range(2)]

        if a[0] == a[1] == -1:
            if a[2] != 0:
                dp[0][0][2] = 1
            dp[0][1][2] = 1
            dp[1][0][2] = 1
            if a[2] != 1:
                dp[1][1][2] = 1
        elif a[0] == -1:
            if not a[1] == a[2] == 0:
                dp[0][a[1]][2] = 1
            if not a[1] == a[2] == 1:
                dp[1][a[1]][2] = 1
        elif a[1] == -1:
            if not a[0] == a[2] == 0:
                dp[a[0]][0][2] = 1
            if not a[0] == a[2] == 1:
                dp[a[0]][1][2] = 1
        else:
            if not a[0] == a[1] == a[2]:
                dp[a[0]][a[1]][2] = 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[k][1 - k][i + 1] |= dp[j][k][i]
                        else:
                            dp[k][0][i + 1] |= dp[j][k][i]
                            dp[k][1][i + 1] |= dp[j][k][i]
                    else:
                        if j == k == a[i]:
                            pass
                        else:
                            dp[k][a[i]][i + 1] |= dp[j][k][i]
        
        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[a1][a2][2] and dp[b1][b2][n]:
                            print('Yes')
                            return
    print('No')


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