#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <limits>
#include <queue>
#include <stack>
#include <vector>
#include <map>

using namespace std;

#define N 244000
#define INF 0x3f3f3f3f
#define PI acos (-1.0)
#define EPS 1e-8
#define met(a, b) memset (a, b, sizeof (a))

char s[N], s1[N];
int p[N];

int manacher()
{
    int index=0, MaxLen = 0, ans=0;

    for(int i=2; s[i]; i++)
    {

        if(MaxLen > i) p[i] = min(MaxLen-i, p[2*index-i]);
        else p[i] = 1;
        while( s[i-p[i]] == s[i+p[i]] )
            p[i]++;

        if(i+p[i]>MaxLen)
        {
            MaxLen = p[i]+i;
            index = i;
        }

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

    return ans-1;
}

int main()
{
    while(scanf("%s", s1)!=EOF)
    {
        int len = strlen(s1), i;

        memset(s, 0, sizeof(s));

        s[0] = ‘$‘;
        for(i=1; i<=len; i++)
        {
            s[i*2-1] = ‘*‘;
            s[i*2]   =  s1[i-1];
        }
        s[i*2-1] = ‘*‘;
        s[i*2] = ‘\0‘;

        printf("%d\n", manacher());
    }
    return 0;
}

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

const int MAXN = 2e6+7;
const int oo = 1e9+37;

char s[MAXN];
int  p[MAXN];

int Manacher(int len)
{
    int id=0, Max=0;

    for(int i=2; i<len; i++)
    {
        p[i] = 1;

        if(p[id]+id > i)
            p[i] = min(p[id*2-i], p[id]+id-i);
        while(s[i+p[i]] == s[i-p[i]])
            p[i]++;
        if(p[id]+id < p[i]+i)
            id = i;

        Max = max(Max, p[i]-1);
    }

    return Max;
}

int main()
{
    int t = 1;

    while(scanf("%s", s), strcmp(s, "END"))
    {
        int N = strlen(s);

        for(int i=N; i>=0; i--)
        {
            s[i+i+2] = s[i];
            s[i+i+1] = ‘#‘;
        }
        s[0] = ‘$‘;

        printf("Case %d: %d\n", t++, Manacher(N+N+1));
    }

    return 0;
}