#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstring>
#include<queue>
using namespace std;
int sol,msk,i,j,nr,L,p,u,mij,ras,pw[25],v[50009];
char sir[10000009],S[30];
int main()
{
freopen("abc2.in","r",stdin);
freopen("abc2.out","w",stdout);
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;
    nr++;
    L=strlen(S+1);
    for(i=1;i<=L;i++)
        v[nr]+=pw[L-i]*(S[i]-'a');
}
msk=0;
for(i=1;i<=L;i++)
    msk+=pw[L-i]*(sir[i]-'a');
sort(v+1,v+nr+1);
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';
    }
    p=1;
    u=nr;
    while(p<=u)
    {
        mij=(p+u)>>1;
        if(v[mij]==msk) break;
        else
        if(v[mij]<msk) p=mij+1;
        else u=mij-1;
    }
    if(p<=u) sol++;
}
printf("%d\n",sol);
return 0;
}