#include <stdio.h>

#include <string.h>

#include <vector>

#include<math.h>

#include <algorithm>

#include<iostream>

#define INF 0x3f3f3f3f

using namespace std;

const long long mod = +;

const int MAXSIZE = ;

string s[MAXSIZE];

long long var[MAXSIZE];

long long k[MAXSIZE];

struct node

{

    int op,id;

    int var[MAXSIZE];

    bool operator < (const node &a)const

    {

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

        {

            if(var[i] != a.var[i])

                return var[i] > a.var[i];

        }

        return ;

    }

}p[];

int main()

{

    int n,cns=;

    while(scanf("%d",&n)!=EOF)

    {

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

        {

            p[i].id = i;

            p[i].op = ;

            for(int j=;j<MAXSIZE;j++)

                p[i].var[j]=;

        }

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

        {

            cin>>s[i];

            int len = s[i].size();

            if(len > )

                p[s[i][]-'a'].op = ;

            for(int j=;j<len;j++)

            {

                int id = s[i][len-j-] - 'a';

                p[id].var[j]++;

            }

        }

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

        {

            for(int j=;j<MAXSIZE;j++)

            {

                p[i].var[j+] += p[i].var[j]/;

                p[i].var[j] = p[i].var[j]%;

            }

        }

        sort(p,p+);

        int v = ;

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

            var[p[i].id] = v--;

        int pos = ;

        while(pos && p[pos].op)

        {

            swap(var[p[pos].id],var[p[pos-].id]);

            pos--;

        }

        long long ans = ,num;

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

        {

            int len = s[i].size();

            num=;

            for(int j=;j<len;j++)

            {

                num = (num* + var[s[i][j]-'a'])%mod;

            }

            ans = (ans+num)%mod;

        }

        printf("Case #%d: %lld\n",cns++,ans);

    }

    return ;

}