#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

ll T, n, t, ans;
ll a[200100];
ll b[200100];
char c[200100];

bool ok(ll x) {
	return !b[x] && !b[x + 1] && b[x + 2] == 1 && !b[x + 3];
}

int main() {
	scanf("%lld", &T);
	while (T--) {
		scanf("%lld", &n);
		scanf("%s", c + 1);
		for (ll i = 1; i <= n; i++) {
			if (c[i] == 'C') {
				a[i] = 0;
			} else {
				a[i] = 1;
			}
			b[i] = a[i];
		}
		a[n + 2] = a[n + 3] = a[n + 1] = a[0] = -1;
		ans = 0;
		for (ll i = 1; i + 3 <= n; i++) {
			if (ok(i)) {
				ans++;
			}
		}
		if (n >= 3) {
			if (a[n] && !a[n - 1] && !a[n - 2]) {
				ans++;
			} else {
				for (ll i = 1; i <= n; i++) {
					ll x = 0;
					ll y = 0;
					ll z = 0;
					t = 0;
					for (ll j = max(1ll, i - 3); j < i; j++) {
						b[++t] = a[j];
					}
					for (ll j = i; j <= min(i + 3, n); j++) {
						b[++t] = a[j];
					}
					for (ll j = 1; j + 3 <= t; j++) {
						x += ok(j);
					}
					t = 0;
					for (ll j = max(1ll, i - 3); j < i; j++) {
						b[++t] = a[j];
					}
					b[++t] = 0;
					for (ll j = i; j <= min(i + 3, n); j++) {
						b[++t] = a[j];
					}
					for (ll j = 1; j + 3 <= t; j++) {
						y += ok(j);
					}
					t = 0;
					for (ll j = max(1ll, i - 3); j < i; j++) {
						b[++t] = a[j];
					}
					b[++t] = 1;
					for (ll j = i; j <= min(i + 3, n); j++) {
						b[++t] = a[j];
					}
					for (ll j = 1; j + 3 <= t; j++) {
						z += ok(j);
					}
					if (x < y || x < z) {
						ans++;
						break;
					}
				}
			}
		}
		printf("%lld\n", ans);
	}
	return 0;
}