#include<stdio.h>

#include<string.h>

#include<algorithm>

using namespace std;

const int N = 2e6+;

int p[N];

char s[N];

int Manacher(char s[], int n)

{

    int Id=, mx = , ans = ;

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

    {

        if(mx > i)

            p[i] = min(p[Id*-i], mx-i);

        else

            p[i] = ;

        while(s[i+p[i]] == s[i-p[i]])

            p[i]++;

        if(mx < p[i]+i)

        {

            mx = p[i]+i;

            Id = i;

        }

        ans = max(ans, p[i]);

    }

    return ans - ;

}

int main()

{

    int t=;

    while(scanf("%s", s),strcmp(s, "END"))

    {

        int len = strlen(s);

        for(int i=len; i>=; i--)

        {

            s[i+i+] = s[i];

            s[i+i+] = '#';

        }

        s[] = '$';

        int ans = Manacher(s, *len+);

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

    }

return ;

}