#include <bits/stdc++.h>

#define ll long long

void solve(){
	int n;
	std::string s;

	std::cin >> n >> s;
	int sum = 0;
	for (int i = 0;i + 3 < n;i++){
		if (s.substr(i, 4) == "CCPC"){
			sum++;
		}
	}
	int ans = sum;
	for (int i = 0;i <= n;i++){
		int l = std::max(0, i - 4), r = std::max(n - 1, i + 4);
		int tmp = sum;
		for (int j = l;j + 3 <= r;j++){
			if (s[j] == 'C' && s[j + 1] == 'C' && s[j + 2] == 'P' && s[j + 3] == 'C'){
				tmp--;
			}
		}
		std::string pre;
		for (int j = l;j < i;j++){
			pre.push_back(s[j]);
		}
		std::string nxt;
		for (int j = i;j <= r;j++){
			nxt.push_back(s[j]);
		}
		std::string t1 = pre + "C" + nxt;
		std::string t2 = pre + "P" + nxt;
		int cur1 = tmp,cur2 = tmp;
		for (int j = 0;j + 3 < t1.size();j++){
			if ((t1[j] == 'C' && t1[j + 1] == 'C' && t1[j + 2] == 'P' && t1[j + 3] == 'C')){
				cur1++;
			}
		}
		for (int j = 0;j + 3 < t1.size();j++){
			if ((t2[j] == 'C' && t2[j + 1] == 'C' && t2[j + 2] == 'P' && t2[j + 3] == 'C')){
				cur2++;
			}
		}
		ans = std::max({ans, cur1, cur2});
	}
	std::cout << ans << '\n';
}

int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int t;
	std::cin >> t;

	while (t--){
		solve();
	}

	return 0;
}