#include <bits/stdc++.h>
#define ll long long
#define PII pair<int,int>
#define endl '\n'
#define int long long
#define  lc p<<1
#define  rc p<<1|1
using namespace  std;
const int N = 2e5 + 10;
int cnt = 0;
string s;
int a[N],b[N];
int f1[N],f2[N];
void solve() {
	
	int n;
	cin>>n;
	cin >> s;
	for(int i=0;i<n-3;i++){
		if(s[i]=='C'&&s[i+1]=='C'&&s[i+2]=='P'&&s[i+3]=='C'){
			a[i+3]++;
			b[i]++;
		}
	}
	for(int i=1;i<=n;i++){
		f1[i]=f1[i-1]+a[i-1];
	}
	f2[n+1]=0;
	for(int i=n;i>=1;i--){
		f2[i]=f2[i+1]+b[i-1];
	}
	int ans=f1[n];
	for(int i=0;i<=n;i++){
		int s1=0,s2=0;
		if(i+3<=n&&s[i]=='C'&&s[i+1]=='P'&&s[i+2]=='C'){
			s1++;
		}
		if(i>=1&&i+2<=n&&s[i-1]=='C'&&s[i]=='P'&&s[i+1]=='C'){
			s1++;
		}
		if(i>=2&&i+1<=n&&s[i-2]=='C'&&s[i-1]=='C'&&s[i]=='C'){
			s2++;
		}
		if(i>=3&&i<=n&&s[i-3]=='C'&&s[i-2]=='C'&&s[i-1]=='P'){
			s1++;
		}
		ans=max(ans,f1[i]+f2[i+1]+max(s1,s2));
//		cout<<f1[i]<<' '<<f2[i+1]<<' '<<max(s1,s2)<<endl;
	}
	cout<<ans<<endl;
}
signed main() {
	 ios::sync_with_stdio(false),cin.tie(0);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
}