#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
int vis[maxn];
void solve(){
int n;
    string s;
    cin>>n>>s;
    vector<int>cc;
    for(int i=0,c=0;i<n;i++) {
        if(s[i]=='C')c++;
        else cc.push_back(c),c=0;
        if(i==n-1)cc.push_back(c);
    }
    int f=0;
    if(cc.size()==1&&cc[0]>=3)f=1;
    for(int i=0;i+1<cc.size();i++) {
        if(cc[i]>=4) {
            f=1;
        }
        if(cc[i+1]==0&&cc[i]>=2)f=1;
        if(cc[i]==1&&cc[i+1]==1)f=1;
    }
    cout<<f<<'\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T;
    cin>>T;
    while(T--) {
        solve();
    }

}