#include <bits/stdc++.h>
using namespace std;
long long a, b, c, k, x, i, d[1005][1005], j, m, n, pfs[1000001], y=0;
string s;
map<long long, long long>dem;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>b;
for(x=1; x<=b; x++){
    cin>>c;
    cin>>s;
    i=0, j=0;
    n=0;
    while(i<s.size()){
        while(i<s.size() && s[i]!=s[i+1])
            i++;
        j=i;
        while(i<s.size() && s[i]==s[i+1])
            i++;
        n=max(n, i-j+1);
    }
    cout<<"Case #"<<x<<": "<<n<<"\n";
}
return 0;
}
