#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#define maxn 1000010
#define rep(i,x,y) for(register int i=(x);i<=(y);i++)
#define dwn(i,x,y) for(register int i=(x);i>=(y);i--)
#define vv ch[u][i]
using namespace std;
inline int read()
{int x=0,f=1;char ch=getchar();while(isdigit(ch)==0 && ch!='-')ch=getchar();if(ch=='-')f=-1,ch=getchar();while(isdigit(ch))x=x*10+ch-'0',ch=getchar();return x*f;
}
inline void write(int x)
{int f=0;char ch[20];if(!x){puts("0");return;}if(x<0){putchar('-');x=-x;}while(x)ch[++f]=x%10+'0',x/=10;while(f)putchar(ch[f--]);putchar('\n');
}
int ch[maxn][30],val[maxn],fail[maxn],cnt=0,n,len;
char s[maxn];
int gx(char c){return c-'a';}
void build()
{int u=0;rep(i,0,len-1){if(!ch[u][gx(s[i])])ch[u][gx(s[i])]=++cnt;u=ch[u][gx(s[i])];}val[u]++;
}
void getfail()
{fail[0]=0;queue<int >q;rep(i,0,25)if(ch[0][i])q.push(ch[0][i]),fail[ch[0][i]]=0;while(!q.empty()){int u=q.front();q.pop();rep(i,0,25){if(vv)q.push(vv),fail[vv]=ch[fail[u]][i];else vv=ch[fail[u]][i];}}
}
int getans()
{int ans=0,u=0;rep(i,0,len-1){u=ch[u][gx(s[i])];for(int j=u;j&&val[j]!=-1;j=fail[j])ans+=val[j],val[j]=-1;}return ans;
}
int main()
{n=read();rep(i,1,n)scanf("%s",s),len=strlen(s),build();getfail();scanf("%s",s),len=strlen(s);write(getans());return 0;
}

#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<ctime>
#include<string>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define LL long long
#define MAXN 1000+1000000
#define INF 2147483647using namespace std;
inline int read(){int x=0,f=1; char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;for(;isdigit(ch);ch=getchar())x=ch-'0'+(x<<3)+(x<<1);return x*f;
}char str[MAXN];
struct ACAutomata{int ch[MAXN][31],val[MAXN],size;queue<int>Q; int fail[MAXN],vis[MAXN];void insert(){int cur=0,len=strlen(str);for(int i=0;i<len;i++){if(ch[cur][str[i]-'a'])cur=ch[cur][str[i]-'a'];else ch[cur][str[i]-'a']=++size,cur=size;}val[cur]++; return ;}void calc(){while(!Q.empty()){int u=Q.front(); Q.pop();for(int i=0;i<26;i++){if(!ch[u][i])continue;int cur=fail[u]; Q.push(ch[u][i]);while(!ch[cur][i]&&cur)cur=fail[cur];fail[ch[u][i]]=ch[cur][i];}}return ;}int solve(){int cur=0,ans=0,len=strlen(str),pos=0;while(pos<len){for(int i=cur;!vis[i]&&i!=0;i=fail[i])ans+=val[i],vis[i]=1; if(ch[cur][str[pos]-'a'])cur=ch[cur][str[pos]-'a'];else {cur=fail[cur];while(!ch[cur][str[pos]-'a']&&cur)cur=fail[cur];cur=ch[cur][str[pos]-'a'];}for(int i=cur;!vis[i]&&i!=0;i=fail[i])ans+=val[i],vis[i]=1; pos++;}return ans;}
}T;int main(){int n=read();for(int i=1;i<=n;i++){scanf("%s",str);T.insert();}for(int i=0;i<=25;i++)if(T.ch[0][i])T.Q.push(T.ch[0][i]);T.calc(); scanf("%s",str); printf("%d",T.solve());return 0;
}