import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const numCases = readInt; foreach (caseId; 0 .. numCases) { const N = readInt; const S = readToken; bool ans; foreach (p; 0 .. 4) { // 0 , 1, 2 , 3, 4 // emp, 0, 00, 1, 11 bool[5] crt; crt[0] = true; foreach (i; 0 .. N + 2) { bool[5] nxt; void update(int u, int v) { if (crt[u]) nxt[v] = true; } const s = S[i % N]; if ((i % N >= 2 || (p >> (i % N) & 1) == 0) && (s == '?' || s == '0')) { update(0, 1); update(1, 2); update(3, 1); update(4, 1); } if ((i % N >= 2 || (p >> (i % N) & 1) == 1) && (s == '?' || s == '1')) { update(0, 3); update(1, 3); update(2, 3); update(3, 4); } crt = nxt; } foreach (u; 0 .. 5) { ans = ans || crt[u]; } } writeln(ans ? "Yes" : "No"); } } } catch (EOFException e) { } }