//  _                          _   _                            
// | |   ___    _ __     ___  | | (_)  _ __     ___   ___   ___ 
// | |  / _ \  | '_ \   / _ \ | | | | | '_ \   / _ \ / __| / __|
// | | | (_) | | | | | |  __/ | | | | | | | | |  __/ \__ \ \__ \
// |_|  \___/  |_| |_|  \___| |_| |_| |_| |_|  \___| |___/ |___/
//                                                              
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<unordered_map>
using namespace std;
#define int long long
#define endl "\n"
const int N = 1e6+10,mod=1e9+13;

typedef pair<int,int> PII;
int n,m;
void solve()
{
    string s;
    cin>>n>>s;
    string tem;
    vector<int>d(n+1,0);
    for(int i = n-1;i >= 0; i --){
        d[i]=d[i+1];
        if(n-i>=4&&s[i]=='C'&&s[i+1]=='C'&&s[i+2]=='P'&&s[i+3]=='C')d[i]++;
    }
    int ans = 0;
    int cnt = 0;
    for(int i = 0;i < n;i ++){
        if(i>2){
            if(s[i]=='C'&&s[i-1]=='P'&&s[i-2]=='C'&&s[i-3]=='C')cnt++;
        }
        int cntc=0,cntp=0;
        if(i+3<n&&s[i+1]=='C'&&s[i+2]=='P'&&s[i+3]=='C')cntc++;
        if(i>=0&&i+2<n&&s[i]=='C'&&s[i+1]=='P'&&s[i+2]=='C')cntc++;
        if(i-2>=0&&s[i-2]=='C'&&s[i-1]=='C'&&s[i]=='P')cntc++;
        ans = max(ans,cntc+cnt+d[i+1]);
        if(i-1>=0&&i+1<n&&s[i-1]=='C'&&s[i]=='C'&&s[i+1]=='C')cntp++;
        ans = max(ans,cntp+cnt+d[i+1]);
    }
    cout<<ans<<endl;
}
signed  main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}