#include <fstream>
#include<vector>
#include<cstring>
const int prim =  6666631;
using namespace std;
 
ifstream fin("abc2.in");
ofstream fout("abc2.out");
 
char text[10000002], word[21];
vector<long long> Hash[prim];
long long pow3[21], cod, key, dim, n,m, match = 0, i, j;
 
 
int main()
{
    pow3[0] = 1;
    for( i = 1; i<=21; ++i) pow3[i] = pow3[i-1]*3;
 
    fin >> text;
    m = strlen(text);
 
    while(fin >> (word))
    {
        n = strlen(word);
        cod = 0;
        for(i = 0; i<n; ++i) cod += (word[i] - 'a')*pow3[i];
        Hash[cod%prim].push_back(cod);
    }
    cod = 0;
 
    for( i = 0; i<n; ++i){
        cod+=(text[i] - 'a')*pow3[i];
    }
    for(; i<m; ++i){
        key = cod%prim;
        dim = Hash[key].size();
        for( j = 0; j<dim; ++j){
            if(Hash[key][j]==cod){
            match++;
            break;
            }
        }
        cod/=3;
        cod+=pow3[n-1]*(text[i]-'a');
    }
    key = cod%prim;
    dim = Hash[key].size();
    for(i = 0; i<dim; ++i){
        if(Hash[key][i]==cod){
        match++;
        break;
        }
    }
 
    fout << match;
 
    return 0;
}