#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#define maxn 100010
#define LL long long
#define mod 10007
using namespace std;

int dp[1010][1010],sum[1010][1010];
char a[1010] ;
int main()
{
    int n,i,j,m;
    int T,case1=0;
    cin >> T ;
    while( T-- )
    {
        scanf("%s",a+1) ;
        n = strlen(a+1) ;
        memset(dp,0,sizeof(dp)) ;
        memset(sum,0,sizeof(sum)) ;
        for( i = n ; i >= 1 ;i--)
            for( j = i ; j <= n ;j++)
        {
            if(i==j)
            {
                dp[i][j]=1;
                sum[i][j]=1;
                continue;
            }
            dp[i][j] = dp[i][j-1] ;
            if(a[i]==a[j])
            {
                dp[i][j]++;
               // for(int k = i+1 ; k < j ;k++)
                   // dp[i][j] += dp[k][j-1];
                   dp[i][j] += sum[i+1][j-1] ;
            }
            dp[i][j] %= mod;
            sum[i][j] = (sum[i+1][j]+dp[i][j])%mod;
        }
        int ans=0;
        for(i = 1 ; i <= n ;i++)
            ans = (ans+dp[i][n])%mod ;
        printf("Case %d: %d\n",++case1,ans);
    }
    return 0;
}