#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define srep(i, s, t) for(int i = (s); i < (t); i++)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
template < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }
template < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }
using i64 = long long;
using f64 = long double;
i64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) <  0 && n % d != 0); }
i64  ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); }

int solve() {
    int n; cin >> n;
    string s; cin >> s;

    s = "XXXXX" + s + "XXXXX";

    int cnt = 0, f = 0;
    for(int i = 5; i <= n + 5; i++) {
        if(s.substr(i, 4) == "CCPC") {
            cnt++;
        } else {
            if(s.substr(i, 3) == "CCC") {
                if(s.substr(i, 5) == "CCCPC");
                else f = 1;
            }
            if(s.substr(i, 3) == "CCP") f = 1;
            if(s.substr(i, 3) == "CPC") {
                if(s.substr(i - 1, 4) == "CCPC");
                else f = 1;
            }
        }
    }
    return cnt + f;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    int T; cin >> T;
    rep(_, T) cout << solve() << "\n";
}