//不同回文子串数目
#include <iostream>
#include <string>
#include <cmath>
#include <map>
using namespace std;
#define N 200010
int ws1[N],wv[N],wa[N],wb[N];
int rank1[N],height[N],sa[N];
char str[N];
int a[N],n;
int dp[N][25],vis[N];int mmin(int a,int b)
{return a>b?b:a;
}int cmp(int *r,int a,int b,int l)
{return r[a]==r[b] && r[a+l]==r[b+l];
}void da(int *r,int *sa,int n,int m)
{int i,j,p,*x=wa,*y=wb,*t;for(i=0;i<m;i++)ws1[i]=0;for(i=0;i<n;i++)ws1[x[i]=r[i]]++;for(i=1;i<m;i++)ws1[i]+=ws1[i-1];for(i=n-1;i>=0;i--)sa[--ws1[x[i]]]=i;for(j=1,p=1;p<n;j*=2,m=p){for(p=0,i=n-j;i<n;i++)y[p++]=i;for(i=0;i<n;i++)if(sa[i]>=j)y[p++]=sa[i]-j;for(i=0;i<n;i++)wv[i]=x[y[i]];for(i=0;i<m;i++)ws1[i]=0;for(i=0;i<n;i++)ws1[wv[i]]++;for(i=1;i<m;i++)ws1[i]+=ws1[i-1];for(i=n-1;i>=0;i--)sa[--ws1[wv[i]]]=y[i];for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;i++)x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;}
}void calheight(int *r,int *sa,int n)
{int i,j,k=0;for(i=1;i<=n;i++)rank1[sa[i]]=i;for(i=0;i<n;height[rank1[i++]]=k)for(k?k--:0,j=sa[rank1[i]-1];r[i+k]==r[j+k];k++) ;
}void RMQ(int n)//RMQ预处理
{int i,j;memset(dp,127,sizeof(dp));for(i=1;i<=n;i++)dp[i][0]=height[i];for(j=1;(1<<j)<=n;j++)for(i=1;i+(1<<j)-1<=n;i++)dp[i][j]=mmin(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
}int lcp(int l,int r)//求最长公共前缀
{int a=rank1[l],b=rank1[r];if(a>b)swap(a,b);a++;int t=(int)(log(double(b-a+1))/log(2.00));return mmin(dp[a][t],dp[b-(1<<t)+1][t]);
}int main()
{int T,i,k,ca=0,s,t,ans;scanf("%d",&T);while(T--){scanf("%s",str);k=strlen(str);str[k]='9';for(i=0;i<k;i++)str[i+k+1]=str[k-i-1];str[2*k+1]='0';n=2*k+2;str[n]='\0';for(i=0;i<n;i++)  a[i]=(int)str[i]; da(a,sa,n,'z'+1);calheight(a,sa,n-1);RMQ(n-1);ans=0;memset(vis,0,sizeof(vis));s=0;for(i=2;i<n;i++)//奇数的时候
        {s=mmin(s,height[i]);if(vis[2*k-sa[i]]){t=lcp(sa[i],2*k-sa[i]);if(t>s){ans+=t-s;s=t;}}elsevis[sa[i]]=1;}memset(vis,0,sizeof(vis));s=0;for(i=2;i<n;i++)//偶数的时候
        {s=mmin(s,height[i]);if(!sa[i])continue;if(vis[2*k-sa[i]+1]){t=lcp(sa[i],2*k-sa[i]+1);if(t>s){ans+=t-s;s=t;}}elsevis[sa[i]]=1;}printf("Case #%d: %d\n",++ca,ans);}return 0;
}