#line 2 "/home/cocojapanpan/Procon_CPP/proconLibrary/lib/template/procon.hpp" #ifndef DEBUG // 提出時にassertはオフ #ifndef NDEBUG #define NDEBUG #endif // 定数倍高速化 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif #include using namespace std; using ll = long long; #define ALL(x) (x).begin(), (x).end() template using vec = vector; template inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } template constexpr T INF = 1'000'000'000; template <> constexpr int INF = 1'000'000'000; template <> constexpr ll INF = ll(INF) * INF * 2; #line 2 "main.cpp" bool solve() { int N; cin >> N; string S; cin >> S; // まずは2連続で続く所の隣の'?'は確定で埋められる for(int i = 0; i < N; i++) { if(S[i] != '?' && S[i] == S[(i+1)%N]) { int left = (i + N - 1) % N; int right = (i + 2) % N; char notsi = 1 - (S[i] - '0') + '0'; if(S[left] == '?') { S[left] = notsi; { int cur = left; while(cur != 0 && cur != N - 1) { int pre = (cur + N - 1) % N; if(S[cur] != S[pre]) break; int prepre = (cur + N - 2) % N; if(S[prepre] == S[cur]) return false; S[prepre] = 1 - (S[cur] - '0') + '0'; cur = prepre; } } } else if(S[left] == S[i]) { return false; } if(S[right] == '?') { S[right] = notsi; } else if(S[right] == S[i]) { return false; } } } return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int T; cin >> T; for(int i = 0; i < T; i++) { cout << (solve() ? "Yes" : "No") << "\n"; } }