#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

const int INF = 1012345678;

int main() {
	int T;
	cin >> T;
	vector<vector<int> > tbl = {
		{1, 0},
		{2, 0},
		{2, 3},
		{1, 0}
	};
	for (int id = 1; id <= T; id++) {
		int N; string S;
		cin >> N >> S;
		vector<int> dp((N + 1) * 44, -1);
		auto dfs = [&](auto& self, int pos, int d, int s) -> int {
			if (d > 10) {
				return -INF;
			}
			int h = pos * 44 + d * 4 + s;
			if (dp[h] != -1) {
				return dp[h];
			}
			int ans = -(d * (d - 1) / 2);
			for (int i = 0; i < 2; i++) {
				char c = (i == 0 ? 'C' : 'P');
				int f = 0;
				if (pos != N && S[pos] == c) {
					f = 1;
				}
				int res = self(self, pos + (f == 1 ? 1 : 0), d + (f == 1 ? 0 : 1), tbl[s][i]);
				if (s == 3 && i == 0) {
					res++;
				}
				ans = max(ans, res);
			}
			dp[h] = ans;
			return ans;
		};
		int result = dfs(dfs, 0, 0, 0);
		cout << result << endl;
	}
	return 0;
}