#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 200100;

int n;
char s[maxn];

inline bool check(int i) {
	return 1 <= i && i + 3 <= n && s[i] == 'C' && s[i + 1] == 'C' && s[i + 2] == 'P' && s[i + 3] == 'C';
}

void solve() {
	scanf("%d%s", &n, s + 1);
	int ans = 0;
	for (int i = 1; i <= n; ++i) {
		ans += check(i);
	}
	int r = ans;
	for (int i = 0; i <= n; ++i) {
		int t = r;
		t -= check(i - 2);
		t -= check(i - 1);
		t -= check(i);
		t += (1 <= i - 2 && s[i - 2] == 'C' && s[i - 1] == 'C' && s[i] == 'P');
		t += (1 <= i && i + 2 <= n && s[i] == 'C' && s[i + 1] == 'P' && s[i + 2] == 'C');
		t += (i + 3 <= n && s[i + 1] == 'C' && s[i + 2] == 'P' && s[i + 3] == 'C');
		ans = max(ans, t);
		t = r;
		t -= check(i - 2);
		t -= check(i - 1);
		t -= check(i);
		t += (1 <= i - 1 && i + 1 <= n && s[i - 1] == 'C' && s[i] == 'C' && s[i + 1] == 'C');
		ans = max(ans, t);
	}
	printf("%d\n", ans);
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}