#include<stdio.h>
#include<string.h>
#include<malloc.h>

#define M 50321
#define MaxN 10000001

typedef struct _nod
{
	char info[21];
	struct _nod *adr;
} nod;

nod *H[M];
char S[MaxN];
int ln,LN,NR;

int Func(char A[])
{
	int a = 1;
	for(int i=0;i<ln-1;i++)
		a = a*3 + A[i]-'a';
	return a%M;
}

void add(char A[])
{
	int a = Func(A);
	nod *nou = (nod*)malloc(sizeof(nod));
	strcpy(nou->info,A);
	nou->adr = H[a];
	H[a] = nou;
}

void citire(void)
{
	char A[21];
	FILE *f = fopen("abc2.in","r");
	
	fgets(S,sizeof(S),f);
	while(!feof(f))
	{
		fgets(A,sizeof(A),f);
		ln = strlen(A);
		add(A);
	}
	
	fclose(f);
}

int ExistString(char A[21])
{
	int a = Func(A);
	nod *p = H[a];
	while(p)
		if(strcmp(p->info,A) == 0)
			return 1;
		else
			p = p->adr;
	return 0;
}

void solve(void)
{
	LN = strlen(S);
	char A[21];
	for(int i=0;i<=LN-ln;i++)
	{
		for(int j=0;j<ln-1;j++)
			A[j] = S[i+j];
		A[ln-1] = '\n';
		A[ln] = '\0';
		NR += ExistString(A);
	}
}

int main()
{
	FILE *g = fopen("abc2.out","w");
	
	citire();
	solve();
	fprintf(g,"%d ",NR);
	
	fclose(g);
	return 0;
}