#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstring>
#include<queue>
using namespace std;
int p,u,mij,lin,sol,msk,i,j,L,pw[25];
char sir[10000009],S[30];
vector < int > v[666013],h,X;
vector < int > :: iterator it;
int key(int num)
{
    int K=((num^9879825)-(num^8293759)+num*82-(num^8974698))%666013;
    if(K<0) K+=666013;
    return K;
}
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;
    msk=0;
    L=strlen(S+1);
    for(i=1;i<=L;i++)
        msk+=pw[L-i]*(S[i]-'a');
    v[key(msk)].push_back(msk);
    h.push_back(key(msk));
}
msk=0;
for(i=1;i<=L;i++)
    msk+=pw[L-i]*(sir[i]-'a');
for(it=h.begin();it!=h.end();it++)
    sort(v[*it].begin(),v[*it].end());
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=key(msk);
    /*p=0;
    u=v[lin].size()-1;
    while(p<=u)
    {
        mij=(p+u)>>1;
        if(v[lin][mij]==msk) break;
        if(v[lin][mij]<msk) p=mij+1;
        else u=mij-1;
    }
    if(p<=u) sol++;*/
}
printf("%d\n",sol);
return 0;
}