#include using namespace std; using ll = long long; using ld = long double; using pll = pair; using tlll = tuple; constexpr ll INF = 1LL << 60; template bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;} template bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;} ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;} ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;} ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);} ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;} ll mul_limited(ll A, ll B, ll M = INF) { return A > M / B ? M : A * B; } ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;} ll logfloor(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp <= B / A; tmp *= A) {res++;} return res;} ll logceil(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp < B; tmp *= A) {res++;} return res;} ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; } ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); } ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); } template void unique(vector &V) {V.erase(unique(V.begin(), V.end()), V.end());} template void sortunique(vector &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());} #define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false) template void printvec(const vector &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';} template void printvect(const vector &V) {for (auto v : V) cout << v << '\n';} template void printvec2(const vector> &V) {for (auto &v : V) printvec(v);} //* #include using namespace atcoder; using mint = modint998244353; //using mint = modint1000000007; //using mint = modint; //*/ bool sub(ll N, string S) { vector dp(N + 1, vector(3, vector(3, false))); dp.at(0).at(0).at(2) = true; for (ll i = 0; i < N; i++) { for (ll j = 0; j < 3; j++) { for (ll k = 0; k < 3; k++) { if (!dp.at(i).at(j).at(k)) continue; for (ll nk = 0; nk < 2; nk++) { if (nk == 0 && S.at(i) == '1') continue; if (nk == 1 && S.at(i) == '0') continue; ll nj = (k == nk ? j + 1 : 1); if (nj == 3) continue; dp.at(i + 1).at(nj).at(nk) = true; } } } } for (ll j = 0; j < 3; j++) { for (ll k = 0; k < 2; k++) { if (dp.at(N).at(j).at(k)) return true; } } return false; } bool solve(ll N, string S) { for (ll s1 = 0; s1 < 2; s1++) { for (ll s2 = 0; s2 < 2; s2++) { string T = S; if (T.at(0) == '?') T.at(0) = '0' + s1; if (T.at(1) == '?') T.at(1) = '0' + s2; if (T.at(N - 2) == T.at(N - 1) && T.at(N - 1) == T.at(0)) continue; if (T.at(N - 1) == T.at(0) && T.at(0) == T.at(1)) continue; if (sub(N, T)) return true; } } return false; } int main() { ll T; cin >> T; while (T--) { ll N; string S; cin >> N >> S; cout << (solve(N, S) ? "Yes" : "No") << endl; } }