#include <iostream>
#include <algorithm>
#include <string>

using namespace std;

int main()
{
    int t, n;
	cin >> t;
	while (t-- && cin >> n)
	{
		string s;
		cin >> s;
		string p = s;
		sort(p.begin(), p.end());
		int cnt0 = 0;
		int cnt1 = 0;
		for (int i = 0; i < s.size(); i++)
		{
			cnt0 += (s[i] != p[i]);
		}
		reverse(p.begin(), p.end());
		for (int i = 0; i < s.size(); i++)
		{
			cnt1 += (s[i] != p[i]);
		}
		ans = min(cnt0 / 2, cnt1 / 2);
		cout << ans << "\n";
	}
}