#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)

using namespace std;

const int M = 7;

int n;
string s;

bool read(){
	if (!(cin >> n))
		return false;
	cin >> s;
	return true;
}

int aut[5][2] = {{1, 0}, {2, 0}, {2, 3}, {4, 0}, {2, 0}};

void solve(){
	vector<vector<vector<int>>> dp(2, vector<vector<int>>(M, vector<int>(5, -1e9)));
	dp[0][0][0] = 0;
	forn(ii, n + 1){
		int i = ii & 1;
		int ni = i ^ 1;
		int c = s[ii] == 'P';
		dp[ni] = vector<vector<int>>(M, vector<int>(5, -1e9));
		forn(j, M) forn(st, 5){
			dp[ni][j][aut[st][c]] = max(dp[ni][j][aut[st][c]], dp[i][j][st] + (aut[st][c] == 4));
			if (j + 1 == M) continue;
			forn(nc, 2)
				dp[i][j + 1][aut[st][nc]] = max(dp[i][j + 1][aut[st][nc]], dp[i][j][st] + (aut[st][nc] == 4) - j);
		}
	}
	int ans = 0;
	forn(j, M) ans = max(ans, *max_element(dp[n & 1][j].begin(), dp[n & 1][j].end()));
	cout << ans << '\n';
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int t;
	cin >> t;
	while (t--){
		read();
		solve();
	}
}