#include<bits/stdc++.h>

using namespace std;

#define irep(i,l,r) for(int i = l; i <= r; ++ i)
typedef long long ll;
#define IOS ios::sync_with_stdio(false),cin.tie(0);

const int N = 200000 + 7;

int a[N];

void solve(){
	int n;
	string s;
	cin >> n >> s;
	s.push_back('$');
	s.push_back('$');
	s.push_back('$');
	s.push_back('$');
	s.push_back('$');
	
	s = "$" + s;
	int sum = 0, d = 0;
	auto check = [&](int i){
		if(i == 0)return false;
		if(i + 3 > n)return false;
		if(s[i] == 'C' and s[i + 1] == 'C' and s[i + 2] == 'P' and s[i + 3] == 'C')
			return true;
		return false;
	};
	a[0] = 0;
	irep(i, 1, n){
		if(check(i))
			a[i] = 1;
		else a[i] = 0;
	}
	sum = accumulate(a + 1, a + n + 1, 0);
	if(s[1] == 'C' and s[2] == 'P' and s[3] == 'C')d = 1;
	irep(p, 1, n){
		int d1 = 0;
		irep(i, max(1, p - 2), p)d1 -= a[i];
		irep(i, max(1, p - 2), p + 1){
			string temp = "";
			irep(j, i, p)temp.push_back(s[j]);
			temp.push_back('C');
			for(int j = p + 1; temp.length() < 4; ++ j)
				temp.push_back(s[j]);
			if(temp == "CCPC")
				++ d1;
		}
		d = max(d, d1);
		d1 = 0;
		irep(i, max(1, p - 2), p)d1 -= a[i];
		irep(i, max(1, p - 2), p + 1){
			string temp = "";
			irep(j, i, p)temp.push_back(s[j]);
			temp.push_back('P');
			for(int j = p + 1; temp.length() < 4; ++ j)
				temp.push_back(s[j]);
			if(temp == "CCPC")
				++ d1;
		}
		d = max(d, d1);

	}
	cout << sum + d << '\n';
}

int main(){
	IOS
	int T;
	cin >> T;
	while(T --){
		solve();
	}
}