// https://github.com/potato167/po167_library #include #include using namespace std; using ll=long long; const ll ILL=2167167167167167167; const int INF=2100000000; #define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++) #define all(p) p.begin(),p.end() template using pq_ = priority_queue, greater>; template int LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template int UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,T b){if(b bool chmax(T &a,T b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;} template void vec_out(vector &p,int ty=0){ if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'< T vec_min(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template T vec_max(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} template T vec_sum(vector &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;} int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;} template T square(T a){return a * a;} void solve(); // DEAR MYSTERIES / TOMOO int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; cin >> t; rep(i, 0, t) solve(); } void solve(){ /*{ set ok; ok.insert("1"); rep(n, 2, 7) { rep(i, 0, 1 << n) { string S; rep(j, 0, n) { S += (i & (1 << j) ? '1' : '0'); } rep(j, 0, n - 1) { if (S[j] == S[j + 1]) { string T = S.substr(0, j); T += (S[j] == '1' ? '0' : '1'); T += S.substr(j + 2, n - j - 2); if (ok.count(T)) { ok.insert(S); break; } } } } } for (auto x : ok) { cout << x << "\n"; } }*/ int N; cin >> N; int tmp = N; string S; cin >> S; rep(i, 0, N) { if (S[i] == '1') tmp++; } int ok = 0; rep(i, 0, N - 1) if (S[i] == S[i + 1]) ok = 1; if (N == 1) ok = 1; yneos(tmp % 3 == 2 && ok == 1); }