#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
using namespace std;
const int maxn=1005;
struct ss{
	char s[maxn];
}num[100000];
int comp(int x,int y){
	int a=strlen(num[x].s);
	int ans=1;
	for(int i=0;num[x].s[i]==num[y].s[i];i++){
		ans++;
		if(i==a){
			ans++;return ans;
		}
	}
	return ans;
}
int work(){
	freopen("strcmp.in","r",stdin);
	freopen("strcmp.out","w",stdout);
	int n,d=0;
	scanf("%d",&n);
	while(n){
		d++;
		int sum=0;
		for(int i=1;i<=n;i++)scanf("%s",num[i].s);
		for(int i=1;i<=n;i++){
			for(int j=i+1;j<=n;j++){
				int a=strlen(num[i].s);
				int b=strlen(num[j].s);
				if(a<b)sum+=comp(i,j);
				else sum+=comp(j,i);
			}
		}
		printf("Case %d: %d\n",d,sum);
		scanf("%d",&n);
	}
	return 0;
}
int sh=work();
int main(){
	return 0;
}