#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

#include <iostream>

using namespace std;

char s[2000050]; int len[2000050], T;

int main() {

	while(scanf("%s", s+1), strcmp(s+1, "END")!=0) {

		int n=strlen(s+1), ans=1;

		for(int i=n; i; --i) s[i<<1]=s[i], s[i<<1|1]=0;

		n=n<<1|1;

		s[1]=0; s[0]=1; s[n+1]=2;

		int cur=1;

		for(int i=2; i<=n; ++i) {

			int &now=len[i], pos=(cur<<1)-i; now=0;

			now=min(len[pos], cur+len[cur]-i); now=max(0, now);

			while(s[i-now-1]==s[i+now+1]) ++now;

			if(i+now>cur+len[cur]) cur=i;

			ans=max(ans, now);

		}

		printf("Case %d: %d\n", ++T, ans);

	}

	return 0;

}