#include <bits/stdc++.h>
using namespace std;
int n,subl[205],strl;
bool book[200005];
char sub[205][15],str[200005];
void dfs(int k)
{
    if(book[k])return;book[k]=1;
    for(int i=1,f=0;i<n;i++,f=0)
    {
        for(int j=0;j<subl[i];j++)if(sub[i][j]!=str[k+j]||k+j>=strl){f=1;break;}
        if(!f)dfs(k+subl[i]);
    }
}
int main()
{
    while(scanf("%s",sub[++n]),strcmp(sub[n],".")!=0)subl[n]=strlen(sub[n]);
    do{str[strl]=getchar();if(isupper(str[strl]))strl++;}while(str[strl]!=EOF);
    dfs(0);
    for(int i=strl;i>=0;i--)if(book[i]){printf("%d\n",i);return 0;}
}

#include <bits/stdc++.h>
using namespace std;
int n,strl;
bool book[200005];
char str[200005];
struct st{char s[15];int l;}sub[205];
bool cmp(st a,st b){return a.l<b.l;}
int main()
{
    while(scanf("%s",sub[++n].s),strcmp(sub[n].s,".")!=0)
        sub[n].l=strlen(sub[n].s);
    do{str[strl]=getchar();if(isupper(str[strl]))strl++;}while(str[strl]!=EOF);
    n--,book[0]=1,sort(sub+1,sub+1+n,cmp);
    for(int i=1;i<=strl;i++)
        for(int j=1;j<=n&&sub[j].l<=i;j++)
            if(book[i-sub[j].l])
            {
                for(int k=0;k<sub[j].l;k++)
                    if(sub[j].s[k]!=str[i-sub[j].l+k]){book[i]=1;break;}
                if(book[i]^=1)break;
            }
    for(int i=strl;i>=0;i--)if(book[i]){printf("%d\n",i);break;}
    return 0;
}