#include <fstream>
#include<bits/stdc++.h>
using namespace std;
const int baza=3;
const int prim=100003;
vector<long long> hashTable[prim];
string text,cuvant;
long long n,i,j,l,cod,potriviri,h,idx;
int main()
{
    ifstream f("abc2.in");
    ofstream g("abc2.out");
    f>>text;
    l=text.length();
    while(f>>cuvant)
    {
        cod=0;
        n=cuvant.length();
        for(i=0; i<n; ++i)
            cod=cod*baza+cuvant[i]-'a';
        hashTable[cod%prim].push_back(cod);
    }
    cod=0,potriviri=0,h=1;
    for(i=1; i<n; ++i) h=h*baza;
    for(i=0; i<n; ++i)
        cod=cod*baza+text[i]-'a';
    for(; i<l; ++i)
    {
        idx=cod%prim;
        for(unsigned int j=0; j<hashTable[idx].size(); ++j)
        {
            if(hashTable[idx][j]==cod)
            {
                potriviri++;
                break;
            }
        }
        cod=cod-(text[i-n]-'a')*h;
        cod=cod*baza+text[i]-'a';
    }
    idx=cod%prim;
    for(unsigned int j=0; j<hashTable[idx].size(); ++j)
    {
        if(hashTable[idx][j]==cod)
        {
            potriviri++;
            break;
        }
    }
    g<<potriviri<<endl;

    return 0;
}