1 #include <iostream>
  2 #include <string.h>
  3 #include <stdio.h>
  4 #include <algorithm>
  5 using namespace std;
  6 #define LL long long
  7 #define MOD 1000000007
  8 #define MX 100100
  9 
 10 int n;
 11 int al_n[26];
 12 LL num[26][MX];
 13 LL quan[26];
 14 char temp[MX];
 15 bool ok[26];
 16 
 17 bool cmp(int a,int b)
 18 {
 19     if (al_n[a]!=al_n[b])
 20         return al_n[a]>al_n[b];
 21 
 22     for (int i=al_n[a];i>=0;i--)
 23         if (num[a][i]!=num[b][i])
 24         return num[a][i]>num[b][i];
 25 
 26     return 0;
 27 }
 28 
 29 int main()
 30 {
 31     int cnt=1;
 32     while (scanf("%d",&n)!=EOF)
 33     {
 34         memset(quan,0,sizeof(quan));
 35         memset(num,0,sizeof(num));
 36         memset(ok,0,sizeof(ok));
 37 
 38         for (int i=0;i<n;i++)
 39         {
 40             scanf("%s",temp);
 41             int len = strlen(temp);
 42             LL k=1;
 43             for (int j=len-1;j>=0;j--)
 44             {
 45                 num[temp[j]-‘a‘][k]++;
 46                 k++;
 47             }
 48             if (len!=1)
 49                 ok[temp[0]-‘a‘]=1;
 50         }
 51 
 52         for (int i=0;i<26;i++)//字母
 53         {
 54             al_n[i]=0;
 55             for (int j=1;j<MX;j++) //长度
 56             {
 57                 if (num[i][j]) al_n[i]=j;
 58                 if (num[i][j]>=26)
 59                 {
 60                     int jin = num[i][j]/26;
 61                     num[i][j+1]+=jin;
 62                     num[i][j]%=26;
 63                 }
 64             }
 65         }
 66 
 67         int alpa[26];
 68         for (int i=0;i<26;i++) alpa[i]=i;
 69         sort(alpa,alpa+26,cmp);
 70 
 71         if (al_n[alpa[25]]!=0&&ok[alpa[25]]==1)
 72         {
 73             for (int i=25;i>=0;i--)
 74             {
 75                 if (ok[alpa[i]]==0)
 76                 {
 77                     int sbsb=alpa[i];
 78                     for (int j=i+1;j<=25;j++)
 79                         alpa[j-1]=alpa[j];
 80                     alpa[25]=sbsb;
 81                     break;
 82                 }
 83             }
 84         }
 85 
 86         LL ans = 0;
 87         LL qqq = 25;
 88         for (int i=0;i<26;i++)
 89         {
 90             int zimu = alpa[i];
 91             if (al_n[zimu]==0) continue;
 92             LL tp=qqq;
 93             for (int j=1;j<=al_n[zimu];j++)
 94             {
 95                 ans = (ans + (tp * num[zimu][j])%MOD)%MOD;
 96                 tp=(tp*26)%MOD;
 97             }
 98             qqq--;
 99         }
100         printf("Case #%d: %lld\n",cnt++,ans);
101     }
102     return 0;
103 }