#include<stdio.h>
#include<string.h>
#define N 10000000
char d[N],s[N],a[50001][21];
int nr,lg,k;
int search(int st,char s[],int l)
{
	int i;
	for(i=st;i<st+l;i++)
		if(d[i]!=s[i-st])
			return 0;
	return 1;
}
int gasit(char s[])
{
	int i;
	for(i=1;i<=k;i++)
		if(strcmp(s,a[i])==0)
			return 1;
	return 0;
}
void read()
{
	scanf("%s",&d);
	lg=strlen(d);
	while(scanf("%s",&s)!=EOF)
		if(!gasit(s))
			strcpy(a[++k],s);
}
void solve()
{
	int i,j,l;
	for(i=1;i<=k;i++)
	{
		l=strlen(a[i]);
		for(j=0;j<=lg-l;j++)
			if(search(j,a[i],l))
				nr++;
	}
	printf("%d\n",nr);
}
int main()
{
	freopen("abc2.in","r",stdin);
	freopen("abc2.out","w",stdout);
	read();
	solve();
	return 0;
}