1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #define maxn 1000005
 5 #define maxm 1000005
 6 using namespace std;
 7 int n,tot,head,tail,son[maxm][26],fai[maxm],sum[maxm],list[maxm];
 8 char s[maxn];
 9 void clear(){
10         tot=0;
11         memset(son,0,sizeof(son));
12         memset(sum,0,sizeof(sum));
13     }
14     void insert(char *s){
15         int p=0;
16         for (int i=1;s[i];p=son[p][s[i]-'a'],i++) if (!son[p][s[i]-'a']) son[p][s[i]-'a']=++tot;
17         sum[p]++;
18     }
19     void failed(){
20         head=0,tail=1,list[1]=0,fai[0]=-1;
21         while (head!=tail){
22             int x=list[++head];
23             for (int ch=0;ch<26;ch++)
24                 if (son[x][ch]){
25                     list[++tail]=son[x][ch];
26                     int p=fai[x];
27                     while (p!=-1&&!son[p][ch]) p=fai[p];
28                     if (p==-1) fai[son[x][ch]]=0;
29                     else fai[son[x][ch]]=son[p][ch];
30                 }
31         }
32     }
33     void work(char *s){
34         int ans=0;
35         for (int i=1,p=0;s[i];i++){
36             while (p&&!son[p][s[i]-'a']) p=fai[p];
37             p=son[p][s[i]-'a'];
38             for (int t=p;t;t=fai[t]) ans+=sum[t],sum[t]=0;
39         }
40         printf("%d\n",ans);
41     }
42 int main()
43 {
44         cin>>n;//,clear();
45         for (int i=1;i<=n;i++) scanf("%s",s+1),insert(s);
46         failed();
47         scanf("%s",s+1),work(s);
48     return 0;
49 }