#include<cstdio>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>#include<set>#include<map>#include<stack>#include<vector>#include<queue>#include<string>#include<sstream>using namespace std;string s;int T, n;struct Node{ char c; int cnt; Node(char cc, int ccnt) { c = cc; cnt = ccnt; } Node(){}}node[210];int main(){ scanf("%d", &T); while(T--) { scanf("%d", &n); cin>>s; int res = 0; for(int i = 0; i < s.size(); i++) { if(i == 0) { res++; node[res].cnt = 1; node[res].c = s[i]; } else { if(s[i] != s[i-1]) { res++; node[res].cnt = 1; node[res].c = s[i]; } else node[res].cnt++; } } bool ifone = false; for(int i = 1; i <= res; i++) { if(node[i].cnt%2) node[i].cnt = 1; else node[i].cnt = 2; } for(int i = 2; i <= res-1; i++) { if(node[i].cnt == 1){ifone = true; break;} } if(ifone) { if(n%2 == 0) printf("%dn", n-2); else printf("%dn", n-1); } else { int tot = 0; for(int i = 1; i <= res; i++) tot += node[i].cnt; printf("%dn", n-tot); } } return 0;}
