#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#include<queue>

using namespace std;

#define REP(i,s,t) for(int i=s;i<=t;i++)

#define dwn(i,s,t) for(int i=s;i>=t;i--)

#define clr(x,c) memset(x,c,sizeof(x))

const int nmax=1005;

const int inf=0x7f7f7f7f;

int ch[nmax][4],fail[nmax],pt=0,dp[nmax][nmax];

bool F[nmax];

char s[nmax];

int id(char c){

	if(c=='A') return 0;

	if(c=='C') return 1;

	if(c=='G') return 2;

	else return 3;

}

void insert(){

	int t=0,len=strlen(s);

	REP(i,0,len-1) {

		if(!ch[t][id(s[i])]) ch[t][id(s[i])]=++pt;

		t=ch[t][id(s[i])];

	}

	F[t]=true;

}

queue<int>q;

void getfail(){

	q.push(0);fail[0]=0;

	while(!q.empty()){

		int x=q.front();q.pop();

		REP(i,0,3){

			if(ch[x][i]) q.push(ch[x][i]),fail[ch[x][i]]=x==0?0:ch[fail[x]][i];

			else ch[x][i]=x==0?0:ch[fail[x]][i];

		}

		F[x]|=F[fail[x]];

	}

}

void work(int x){

	clr(dp,0x7f);dp[0][0]=0;

	scanf("%s",s);int len=strlen(s);

	REP(i,0,len-1) REP(j,0,pt) if(dp[i][j]!=inf){

		REP(k,0,3){

			int tmp=ch[j][k];if(F[tmp]) continue;

			int temp=(k==id(s[i]))?dp[i][j]:dp[i][j]+1;

			dp[i+1][tmp]=min(dp[i+1][tmp],temp);

		}

	}

	int ans=inf;

	REP(i,0,pt) ans=min(ans,dp[len][i]);

	if(ans==inf) printf("Case %d: -1\n",x);

	else printf("Case %d: %d\n",x,ans);

}

int main(){

	int n,cur=0;

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

		clr(fail,0);clr(ch,0);clr(F,false);pt=0;

		REP(i,1,n) scanf("%s",s),insert();

		getfail();work(++cur);

	}

	return 0;

}