#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#include<set>
using namespace std;
#define ll long long
#define ull unsigned long long
const int maxn=1000010;
int n,m;
vector<int> e[maxn];
char t[maxn],s[maxn];
struct tr{
	int ch[30],fail,num;
	int fin;
}f[maxn];
int tot=0;
void get_in(int x,char *r){
	int now=0,len=strlen(r),i=0;
	while(i<len){
		if(f[now].ch[r[i]-'a']) now=f[now].ch[r[i]-'a'];
		else {
			f[now].ch[r[i]-'a']=++tot;
			now=tot;
		}
		f[now].fin+=(i==len-1);
	//	cout<<i<<" "<<len-1<<" "<<f[now].fin<<endl;;
		i++;
	}
}
queue<int> q;
void bfs(){
	for(int i=0;i<26;i++){
		int now=f[0].ch[i];
		if(!now) continue;
		f[now].fail=0;
		q.push(now);
	}
	while(!q.empty()){
		int u=q.front();
		q.pop();
		for(int i=0;i<26;i++){
			int v=f[u].ch[i];
			if(v){
				f[v].fail=f[f[u].fail].ch[i];
				q.push(v);
			}
			else f[u].ch[i]=f[f[u].fail].ch[i];
		}
	}
}
int ans=0;
int dfs(int x){
	int sum=0;
	for(int j=0;j<e[x].size();j++){
		int v=e[x][j];
		sum+=dfs(v);
	}
	if(f[x].fin&&(sum||f[x].num)) ans+=f[x].fin;
	return sum+f[x].num>0;
}
int main()
{
	//freopen("1.txt","r",stdin); 
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		cin>>t;
		get_in(i,t);
	}
	cin>>s+1;
	bfs();
	int ls=strlen(s+1);
	for(int i=1,j=0;i<=ls;i++){
		while(j&&!f[j].ch[s[i]-'a']) j=f[j].fail;
		if(f[j].ch[s[i]-'a']) j=f[j].ch[s[i]-'a'];
		f[j].num++;
	}
	
    for(int i=1;i<=tot;i++){
		e[f[i].fail].push_back(i);
	}	
	dfs(0);
	printf("%d\n",ans);
	return 0;
}