#include<fstream>
#include<cstring>
#include<algorithm>
#include<vector>
#define MOD 666013
#define NMAX 10000010
using namespace std;
char s[NMAX],sir[25];
vector<int>H[MOD];
int n,m,i;
long long sol,cheie,t,h;
int main()
{
    ifstream f("abc2.in");
    ofstream g("abc2.out");
    f.getline(s+1,NMAX);
    n=strlen(s+1);
    while(f.getline(sir+1,25))
    {
        m=strlen(sir+1);
        t=0;
        for (i=1;i<=m;++i)
            t=(t*3+(sir[i]-'a'));
        cheie=t%MOD;
        bool e=true;
        for (i=0;i<H[cheie].size();++i)
            if (H[cheie][i]==t) {e=false;break;}
        if (e==true)
            H[cheie].push_back(t);
    }
    t=0;h=1;
    for (i=1;i<=m;++i)
    {
        t=(t*3+(s[i]-'a'));
        h=h*3;
    }
    h=h/3;cheie=t%MOD;
    if (binary_search(H[cheie].begin(),H[cheie].end(),t)) ++sol;
    for (i=m+1;i<=n;++i)
    {
        t=((t-(s[i-m]-'a')*h)*3+(s[i]-'a'));
        cheie=t%MOD;
        vector<int>::iterator it;
        for (it=H[cheie].begin();it!=H[cheie].end();++it)
            if (*it==t) {++sol;break;}
    }
    g<<sol<<"\n";
    return 0;
}