import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# md = 10**9+7
md = 998244353

def solve():
    n = II()
    cc = ["01?".find(c) for c in SI()]
    for s0 in range(4):
        dp = [0]*4
        dp[s0] = 1
        for c in cc:
            ndp = [0]*4
            for s in range(4):
                if dp[s] == 0: continue
                for d in range(2):
                    if d == 0 and s == 0: continue
                    if d == 1 and s == 3: continue
                    if d ^ c == 1: continue
                    ndp[s>>1|d<<1]=1
            dp=ndp
        if dp[s0]:
            print("Yes")
            return
    print("No")

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