#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod=1e9+7;
const ll INF = 10000000000000;
const int N = 1e6+7;
void solve() {
int n;
string s;
cin >> n >> s;
bool ok = false;
for(int i=0;i<n-1;i++){
if(i%2==0){
if(s[i]=='1' && s[i+1]=='1') ok=true;
}
}
if(n%2==1){
if(ok || s[0]=='1') cout << "YES\n";
else cout << "NO\n";}
else if(n%2==0){
if(ok || s[0]=='1' || s[n-1]=='1') cout << "YES\n";
else cout << "NO\n";
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGxsOwpjb25zdCBpbnQgTW9kPTFlOSs3Owpjb25zdCBsbCBJTkYgPSAxMDAwMDAwMDAwMDAwMDsKY29uc3QgaW50IE4gPSAxZTYrNzsKCiAgICB2b2lkIHNvbHZlKCkgewogICAgICAgaW50IG47CiAgICAgICBzdHJpbmcgczsKICAgICAgIGNpbiA+PiBuID4+IHM7CiAgICAgICBib29sIG9rID0gZmFsc2U7CiAgICAgICBmb3IoaW50IGk9MDtpPG4tMTtpKyspewogICAgICAgICAgICBpZihpJTI9PTApewogICAgICAgICAgICAgICAgaWYoc1tpXT09JzEnICYmIHNbaSsxXT09JzEnKSBvaz10cnVlOwogICAgICAgICAgICB9CiAgICAgICB9CiAgICAgICBpZihuJTI9PTEpewogICAgICAgaWYob2sgfHwgc1swXT09JzEnKSBjb3V0IDw8ICJZRVNcbiI7CiAgICAgICBlbHNlIGNvdXQgPDwgIk5PXG4iO30KICAgICAgIGVsc2UgaWYobiUyPT0wKXsKICAgICAgIGlmKG9rIHx8IHNbMF09PScxJyB8fCBzW24tMV09PScxJykgY291dCA8PCAiWUVTXG4iOwogICAgICAgZWxzZSBjb3V0IDw8ICJOT1xuIjsKICAgICAgIH0KICAgIH0KaW50IG1haW4oKXsgCiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKG51bGxwdHIpOwoJCiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkgc29sdmUoKTsKICAgIAogICAgcmV0dXJuIDA7Cn0K