#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstring>
#include<queue>
using namespace std;
unsigned int mod,p,u,mij,lin,sol,msk,i,j,L,pw[25];
char sir[10000009],S[30];
vector < unsigned int > v[100009];
vector < unsigned int > :: iterator it;
int main()
{
freopen("abc2.in","r",stdin);
freopen("abc2.out","w",stdout);
mod=100009;
pw[0]=1;
for(i=1;i<=20;i++)
    pw[i]=pw[i-1]*3;
gets(sir+1);
while(!feof(stdin))
{
    gets(S+1);
    if(feof(stdin)) break;
    msk=0;
    L=strlen(S+1);
    for(i=1;i<=L;i++)
        msk+=pw[L-i]*(S[i]-'a');
    v[msk%mod].push_back(msk);
}
msk=0;
for(i=1;i<=L;i++)
    msk+=pw[L-i]*(sir[i]-'a');
for(j=L;sir[j]>='a'&&sir[j]<='c';j++)
{
    if(j!=L)
    {
        msk-=pw[L-1]*(sir[j-L]-'a');
        msk*=3;
        msk+=sir[j]-'a';
    }
    lin=msk%mod;
    for(it=v[lin].begin();it!=v[lin].end();it++)
        if(*it==msk) break;
    if(it!=v[lin].end()) sol++;
}
printf("%d\n",sol);
return 0;
}