#include <bits/stdc++.h>

#define long long long int
#define DEBUG
using namespace std;

// @author: pashka

struct test {

    vector<int> mc = {1, 2, 2, 4, 2};
    vector<int> mp = {0, 0, 3, 0, 0};

    int calc(string &s, int k) {
        vector<vector<int>> d(k + 1, vector<int>(5, INT_MIN));
        d[0][0] = 0;
        int n = s.size();
        for (int i = 0; i < n; i++) {
            vector<vector<int>> dd(k + 1, vector<int>(5, INT_MIN));
            for (int j = 0; j <= k; j++) {
                for (int x = 0; x < 5; x++) {
//                    cout << j << " " << x << " " << d[j][x] << "\n";
                    if (d[j][x] == INT_MIN) continue;
                    {
                        int y = 0;
                        if (s[i] == 'C') {
                            y = mc[x];
                        } else if (s[i] == 'P') {
                            y = mp[x];
                        }
                        dd[j][y] = max(dd[j][y], d[j][x] + (y == 4));
                    }
                    if (j < k) {
                        {
                            int y = mc[x];
                            d[j + 1][y] = max(d[j + 1][y], d[j][x] + (y == 4));
                        }
                        {
                            int y = mp[x];
                            d[j + 1][y] = max(d[j + 1][y], d[j][x] + (y == 4));
                        }
                    }
                }
            }
//            cout << s[i] << "\n";
            d = dd;
        }
        for (int j = 0; j < k; j++) {
            for (int x = 0; x < 5; x++) {
                if (d[j][x] == INT_MIN) continue;
                {
                    int y = mc[x];
                    d[j + 1][y] = max(d[j + 1][y], d[j][x] + (y == 4));
                }
                {
                    int y = mp[x];
                    d[j + 1][y] = max(d[j + 1][y], d[j][x] + (y == 4));
                }
            }
        }
        int res = 0;
        for (int i = 0; i < 5; i++) {
            res = max(res, d[k][i]);
        }
//        cout << s << " " << k << " " << res << "\n";
        return res;
    }

    void solve() {
        int n;
        cin >> n;
        string s;
        cin >> s;
        int res = 0;
        int ss = 0;
        for (int k = 1; k < 5; k++) {
            ss += k - 1;
            res = max(res, calc(s, k) - ss);
        }
        cout << res << "\n";
    }
};

int main() {
    ios::sync_with_stdio(false);

    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        test().solve();
    }

    return 0;
}